The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

A. Frank van der Stappen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels
    Motion Planning for Multiple Robots. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:374-382 [Conf]
  2. Mark de Berg, Matthew J. Katz, A. Frank van der Stappen, Jules Vleugels
    Realistic Input Models for Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:294-303 [Conf]
  3. Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen
    On Fence Design and the Complexity of Push Plans for Orienting Parts. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:21-29 [Conf]
  4. Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen
    Geometric Algorithms for Trap Design. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:95-104 [Conf]
  5. Esther Moet, Marc J. van Kreveld, A. Frank van der Stappen
    On realistic terrains. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:177-186 [Conf]
  6. A. Frank van der Stappen, Mark H. Overmars
    Motion Planning Amidst Fat Obstacles (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:31-40 [Conf]
  7. A. Frank van der Stappen
    Efficient Exact Motion Planning in Realistic Environments. [Citation Graph (0, 0)][DBLP]
    Modelling and Planning for Sensor Based Intelligent Robot Systems, 1994, pp:51-67 [Conf]
  8. A. Frank van der Stappen
    Realistic Environment Models and Their Impact on the Exact Solution of the Motion Planning Problem. [Citation Graph (0, 0)][DBLP]
    Sensor Based Intelligent Robots, 1998, pp:180-199 [Conf]
  9. A. Frank van der Stappen, Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars
    Geometry and Part Feeding. [Citation Graph (0, 0)][DBLP]
    Sensor Based Intelligent Robots, 2000, pp:259-281 [Conf]
  10. Chantal Wentink, A. Frank van der Stappen, Mark H. Overmars
    Fixture Design with Edge-Fixels. [Citation Graph (0, 0)][DBLP]
    Intelligent Robots, 1996, pp:269-286 [Conf]
  11. Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen
    TSP with Neighborhoods of Varying Size. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:187-199 [Conf]
  12. Marc J. van Kreveld, A. Frank van der Stappen
    Approximate Unions of Lines and Minkowski Sums. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:448-459 [Conf]
  13. Mark H. Overmars, A. Frank van der Stappen
    Range Searching and Point Location among Fat Objects. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:240-253 [Conf]
  14. Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen
    Orienting Polyhedral Parts by Pushing. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:136-139 [Conf]
  15. Robert-Paul Berretty, Kenneth Y. Goldberg, Lawrence Cheung, Mark H. Overmars, Gordon Smith, A. Frank van der Stappen
    Trap Design for Vibratory Bowl Feeders. [Citation Graph (0, 0)][DBLP]
    ICRA, 1999, pp:2558-2563 [Conf]
  16. Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen
    Orienting Parts by Inside-out Pulling. [Citation Graph (0, 0)][DBLP]
    ICRA, 2001, pp:1053-1058 [Conf]
  17. Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen
    Sensorless Orientation of 3D Polyhedral Parts. [Citation Graph (0, 0)][DBLP]
    ICRA, 2002, pp:2016-2021 [Conf]
  18. Valérie Boor, Mark H. Overmars, A. Frank van der Stappen
    The Gaussian Sampling Strategy for Probabilistic Roadmap Planners. [Citation Graph (0, 0)][DBLP]
    ICRA, 1999, pp:1018-1023 [Conf]
  19. Jae-Sook Cheong, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen
    Fixturing Hinged Polygons. [Citation Graph (0, 0)][DBLP]
    ICRA, 2002, pp:876-881 [Conf]
  20. A. Frank van der Stappen, Dan Halperin, Mark H. Overmars
    Efficient Algorithms for Exact Motion Planning Amidst Fat Obstacles. [Citation Graph (0, 0)][DBLP]
    ICRA (1), 1993, pp:297-304 [Conf]
  21. A. Frank van der Stappen, Chantal Wentink, Mark H. Overmars
    Computing Form-Closure Configurations. [Citation Graph (0, 0)][DBLP]
    ICRA, 1999, pp:1837-1842 [Conf]
  22. Jae-Sook Cheong, Herman J. Haverkort, A. Frank van der Stappen
    On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:260-269 [Conf]
  23. Han-Wen Nienhuys, A. Frank van der Stappen
    A Surgery Simulation Supporting Cuts and Finite Element Deformation. [Citation Graph (0, 0)][DBLP]
    MICCAI, 2001, pp:145-152 [Conf]
  24. Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
    Models and Motion Planning. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:83-94 [Conf]
  25. Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen
    Dynamic Motion Planning in Low Obstacle Density Environments. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:3-16 [Conf]
  26. Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
    Guarding Scenes against Invasive Hypercubes. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1998, pp:110-120 [Conf]
  27. Mark de Berg, Xavier Goaoc, A. Frank van der Stappen
    A Polynomial-time Algorithm to Design Push Plans for Sensorless Parts Sorting. [Citation Graph (0, 0)][DBLP]
    Robotics: Science and Systems, 2005, pp:89-96 [Conf]
  28. Mark de Berg, A. Frank van der Stappen, Jules Vleugels, Matthew J. Katz
    Realistic Input Models for Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:1, pp:81-97 [Journal]
  29. Jae-Sook Cheong, Herman J. Haverkort, A. Frank van der Stappen
    Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:2, pp:117-136 [Journal]
  30. Marc J. van Kreveld, A. Frank van der Stappen
    Approximate Unions of Lines and Minkowski Sums. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:1, pp:91-107 [Journal]
  31. A. Frank van der Stappen, Kenneth Y. Goldberg
    Geometric Eccentricity and the Complexity of Manipulation Plans. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:26, n:3-4, pp:494-514 [Journal]
  32. Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
    Guarding scenes against invasive hypercubes. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:2, pp:99-117 [Journal]
  33. Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
    Models and motion planning. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:1, pp:53-68 [Journal]
  34. Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen
    Computing fence designs for orienting parts. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:4, pp:249-262 [Journal]
  35. Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen
    Orienting polyhedral parts by pushing. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:21, n:1-2, pp:21-38 [Journal]
  36. Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen
    Dynamic motion planning in low obstacle density environments. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:11, n:3-4, pp:157-173 [Journal]
  37. A. Frank van der Stappen, Dan Halperin, Mark H. Overmars
    The Complexity of the Free Space for a Robot Moving Amidst Fat Obstacles. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:353-373 [Journal]
  38. Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels
    Motion Planning for Multiple Robots. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:4, pp:505-525 [Journal]
  39. A. Frank van der Stappen, Mark H. Overmars, Mark de Berg, Jules Vleugels
    Motion Planning in Environments with Low Obstacle Density. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:4, pp:561-587 [Journal]
  40. Jae-Sook Cheong, A. Frank van der Stappen, Kenneth Y. Goldberg, Mark H. Overmars, Elon Rimon
    Immobilizing Hinged Polygons. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2007, v:17, n:1, pp:45-70 [Journal]
  41. Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen
    Trap Design for Vibratory Bowl Feeders. [Citation Graph (0, 0)][DBLP]
    I. J. Robotic Res., 2001, v:20, n:11, pp:891-908 [Journal]
  42. Michael Erdmann, David Hsu, Mark H. Overmars, A. Frank van der Stappen
    Editorial: Special Issue on WAFR 2004. [Citation Graph (0, 0)][DBLP]
    I. J. Robotic Res., 2005, v:24, n:11, pp:881-882 [Journal]
  43. A. Frank van der Stappen, Chantal Wentink, Mark H. Overmars
    Computing Immobilizing Grasps of Polygonal Parts. [Citation Graph (0, 0)][DBLP]
    I. J. Robotic Res., 2000, v:19, n:5, pp:467-479 [Journal]
  44. Mark de Berg, A. Frank van der Stappen
    On the fatness of Minkowski sums. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:5, pp:259-264 [Journal]
  45. Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen
    TSP with neighborhoods of varying size. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:57, n:1, pp:22-36 [Journal]
  46. Mark H. Overmars, A. Frank van der Stappen
    Range Searching and Point Location among Fat Objects. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:3, pp:629-656 [Journal]
  47. Dezhen Song, A. Frank van der Stappen, Kenneth Y. Goldberg
    An Exact Algorithm Optimizing Coverage-resolution for Automated Satellite Frame Selection. [Citation Graph (0, 0)][DBLP]
    ICRA, 2004, pp:63-70 [Conf]
  48. Han-Wen Nienhuys, A. Frank van der Stappen
    A Computational Technique for Interactive Needle Insertions in 3D Nonlinear Material. [Citation Graph (0, 0)][DBLP]
    ICRA, 2004, pp:2061-2067 [Conf]
  49. Jae-Sook Cheong, A. Frank van der Stappen
    Output-Sensitive Computation of All Form-Closure Grasps of a Semi-Algebraic Set. [Citation Graph (0, 0)][DBLP]
    ICRA, 2005, pp:772-778 [Conf]

  50. Pushing using Compliance. [Citation Graph (, )][DBLP]


  51. Blades: a New Class of Geometric Primitives for Feeding 3D Parts on Vibratory Tracks. [Citation Graph (, )][DBLP]


  52. On the design of traps for feeding 3D parts on vibratory tracks. [Citation Graph (, )][DBLP]


  53. An approximation algorithm for the least overlapping p-Frame problem with non-partial coverage for networked robotic cameras. [Citation Graph (, )][DBLP]


  54. Immobilizing 2D serial chains in form closure grasps. [Citation Graph (, )][DBLP]


  55. An Effective Framework for Path Planning Amidst Movable Obstacles. [Citation Graph (, )][DBLP]


  56. Caging Polygons with Two and Three Fingers. [Citation Graph (, )][DBLP]


  57. Caging convex polygons with three fingers. [Citation Graph (, )][DBLP]


  58. Computing all form-closure grasps of a rectilinear polyhedron with seven frictionless point fingers. [Citation Graph (, )][DBLP]


  59. Surgical retraction of non-uniform deformable layers of tissue: 2D robot grasping and path planning. [Citation Graph (, )][DBLP]


  60. On realistic terrains. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.455secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002