The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mark H. Overmars: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michiel H. M. Smid, Mark H. Overmars
    Maintaining Range Trees in Secondary Memory. Part II: Lower Bounds. [Citation Graph (5, 0)][DBLP]
    Acta Inf., 1989, v:27, n:5, pp:453-480 [Journal]
  2. Mark H. Overmars, Jan van Leeuwen
    Dynamic Multi-Dimensional Data Structures Based on Quad- and K - D Trees. [Citation Graph (4, 0)][DBLP]
    Acta Inf., 1982, v:17, n:, pp:267-285 [Journal]
  3. Mark H. Overmars, Michiel H. M. Smid, Mark de Berg, Marc J. van Kreveld
    Maintaining Range Trees in Secondary Memory. Part I: Partitions. [Citation Graph (4, 0)][DBLP]
    Acta Inf., 1989, v:27, n:5, pp:423-452 [Journal]
  4. Marc J. van Kreveld, Mark H. Overmars
    Divided k-d Trees. [Citation Graph (3, 0)][DBLP]
    Algorithmica, 1991, v:6, n:6, pp:840-858 [Journal]
  5. Jan van Leeuwen, Mark H. Overmars
    Stratified Balanced Search Trees. [Citation Graph (2, 0)][DBLP]
    Acta Inf., 1982, v:18, n:, pp:345-359 [Journal]
  6. Mark H. Overmars, Jan van Leeuwen
    Maintenance of Configurations in the Plane. [Citation Graph (2, 0)][DBLP]
    J. Comput. Syst. Sci., 1981, v:23, n:2, pp:166-204 [Journal]
  7. Hans-Peter Kriegel, Rita Mannss, Mark H. Overmars
    The Inverted File Tree Machine: Efficient Multi-Key Retrieval for VLSI. [Citation Graph (1, 0)][DBLP]
    FODO, 1985, pp:279-291 [Conf]
  8. Mark H. Overmars, Michiel H. M. Smid
    Maintaining Range Trees in Secondary Memory (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    STACS, 1988, pp:38-51 [Conf]
  9. Mark H. Overmars, Jan van Leeuwen
    Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:4, pp:168-173 [Journal]
  10. Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars
    Intersection Queries in Curved Objects. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1993, v:15, n:2, pp:229-266 [Journal]
  11. Herbert Edelsbrunner, Mark H. Overmars
    Batched Dynamic Solutions to Decomposable Searching Problems. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:4, pp:515-542 [Journal]
  12. Mark H. Overmars
    Efficient Data Structures for Range Searching on a Grid. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1988, v:9, n:2, pp:254-275 [Journal]
  13. Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
    Reconfiguring Convex Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  14. Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint
    Computing signed permutations of polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:68-71 [Conf]
  15. Mark de Berg, Prosenjit Bose, Katrin Dobrindt, Marc J. van Kreveld, Mark H. Overmars, Marko de Groot, Thomas Roos, Jack Snoeyink, Sidi Yu
    The Complexity of Rivers in Triangulated Terrains. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:325-330 [Conf]
  16. Mark de Berg, Marko de Groot, Mark H. Overmars
    Perfect Binary Space Partitions. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:109-114 [Conf]
  17. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Mark H. Overmars, Joseph O'Rourke, Steve Robbins, Sue Whitesides
    Unfolding some classes of orthogonal polyhedra. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  18. Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong
    Computing the Angularity Tolerance. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:331-336 [Conf]
  19. Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia
    The Floodlight Problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:399-404 [Conf]
  20. Vincenzo Ferrucci, Mark H. Overmars, Anil S. Rao, Jules Vleugels
    Hunting Voronoi Vertices in Non-Polygonal Domains. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:45-50 [Conf]
  21. Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars
    Intersection Queries for Curved Objects (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:41-50 [Conf]
  22. Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld
    Efficient Ray Shooting and Hidden Surface Removal. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:21-30 [Conf]
  23. Mark de Berg, René van Oostrum, Mark H. Overmars
    Simple Traversal of a Subdivision Without Extra Storage. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:0-5 [Conf]
  24. Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf
    Computing and Verifying Depth Orders. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:138-145 [Conf]
  25. 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]
  26. 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]
  27. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
    Separating point sets in polygonal environments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:10-16 [Conf]
  28. David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars
    Searching for Empty Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:224-228 [Conf]
  29. Dan Halperin, Mark H. Overmars
    Efficient Motion Planning for an L-Shaped Object. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:156-166 [Conf]
  30. Dan Halperin, Mark H. Overmars
    Spheres, Molecules, and Hidden Surface Removal. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:113-122 [Conf]
  31. Matthew J. Katz, Mark H. Overmars, Micha Sharir
    Efficient Hidden Surface Removal for Objects with small Union Size. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:31-40 [Conf]
  32. Berto van de Kraats, Marc J. van Kreveld, Mark H. Overmars
    Printed Circuit Board Simplification: Simplifying Subdivisions in Practice. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:0-0 [Conf]
  33. J. Ian Munro, Mark H. Overmars, Derick Wood
    Variations on Visibility. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:291-299 [Conf]
  34. Mark H. Overmars, Anil S. Rao, Otfried Schwarzkopf, Chantal Wentink
    Immobilizing Polygons against a Wall. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:29-38 [Conf]
  35. Mark H. Overmars, Micha Sharir
    Merging Visibility Maps. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:168-176 [Conf]
  36. Mark H. Overmars, Emo Welzl
    New Methods for Computing Visibility Graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:164-171 [Conf]
  37. 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]
  38. 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]
  39. 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]
  40. Michiel Hagedoorn, Mark H. Overmars, Remco C. Veltkamp
    A New Visibility Partition for Affine Pattern Matching. [Citation Graph (0, 0)][DBLP]
    DGCI, 2000, pp:358-370 [Conf]
  41. Mark H. Overmars
    New Algorithms for Computer Graphics. [Citation Graph (0, 0)][DBLP]
    Advances in Computer Graphics Hardware, 1987, pp:3-19 [Conf]
  42. Mark H. Overmars
    Computational Geometry and its Application to Computer Graphics. [Citation Graph (0, 0)][DBLP]
    Advances in Computer Graphics, 1989, pp:75-107 [Conf]
  43. Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars
    On R-trees with Low Stabbing Number. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:167-178 [Conf]
  44. 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]
  45. 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]
  46. 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]
  47. Michiel Hagedoorn, Mark H. Overmars, Remco C. Veltkamp
    A Robust Affine Invariant Similarity Measure Based on Visibility. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:112-116 [Conf]
  48. Mark de Berg, Mark H. Overmars
    Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:252-261 [Conf]
  49. Mark H. Overmars, Micha Sharir
    Output-Sensitive Hidden Surface Removal [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:598-603 [Conf]
  50. Mark H. Overmars, Chee-Keng Yap
    New upper bounds in Klee's measure problem (extended abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:550-556 [Conf]
  51. Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu
    Feasability of Design in Stereolithography. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:228-237 [Conf]
  52. Mark de Berg, Marc J. van Kreveld, René van Oostrum, Mark H. Overmars
    Simple Traversal of a Subdivision Without Extra Storage. [Citation Graph (0, 0)][DBLP]
    ACM-GIS, 1995, pp:77-0 [Conf]
  53. Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars
    An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:689-702 [Conf]
  54. Mark H. Overmars
    Geometric Algorithms for Robotic Manipulation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:116-117 [Conf]
  55. Mark H. Overmars
    Recent Developments in Motion Planning. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (3), 2002, pp:3-13 [Conf]
  56. 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]
  57. 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]
  58. 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]
  59. 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]
  60. 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]
  61. Danielle Sent, Mark H. Overmars
    Motion Planning in Environments with Dangerzones. [Citation Graph (0, 0)][DBLP]
    ICRA, 2001, pp:1488-1493 [Conf]
  62. 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]
  63. 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]
  64. Petr Svestka, Mark H. Overmars
    Coordinated Motion Planning for Multiple Car-Like Robots Using Probabilistic Roadmaps. [Citation Graph (0, 0)][DBLP]
    ICRA, 1995, pp:1631-1636 [Conf]
  65. Tao Zhang, Gordon Smith, Robert-Paul Berretty, Mark H. Overmars, Kenneth Y. Goldberg
    The Toppling Graph: Designing Pin Sequences for Part Feeding. [Citation Graph (0, 0)][DBLP]
    ICRA, 2000, pp:139-146 [Conf]
  66. Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas
    Multiple Representations of Dynamic Data Structures. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1989, pp:437-442 [Conf]
  67. Greg Aloupis, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark H. Overmars, Michael A. Soss, Ileana Streinu, Godfried T. Toussaint
    Flat-State Connectivity of Linkages under Dihedral Motions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:369-380 [Conf]
  68. Mark de Berg, Mark H. Overmars, Leonidas J. Guibas, Otfried Schwarzkopf, Monique Teillaud, Dan Halperin, Micha Sharir
    Reaching a Goal with Directional Uncertainty. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:1-10 [Conf]
  69. Jan van Leeuwen, Mark H. Overmars
    The Art of Dynamizing. [Citation Graph (0, 0)][DBLP]
    MFCS, 1981, pp:121-131 [Conf]
  70. Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir
    Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:516-525 [Conf]
  71. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
    Locked and Unlocked Polygonal Chains in 3D. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:866-867 [Conf]
  72. Mark H. Overmars, Petr Svestka
    Probabilistic Approaches to Motion Planning. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1996, pp:95-112 [Conf]
  73. Marc J. van Kreveld, Mark H. Overmars
    Concatenable Segment Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:493-504 [Conf]
  74. Mark H. Overmars, Nicola Santoro
    TIME vs BITS. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:282-293 [Conf]
  75. Mark H. Overmars, Jan van Leeuwen
    Dynamically Maintaining Configurations in the Plane (Detailed Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1980, pp:135-145 [Conf]
  76. Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars
    Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:213-224 [Conf]
  77. Mark de Berg, Marko de Groot, Mark H. Overmars
    New Results on Binary Space Partitions in the Plane (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:61-72 [Conf]
  78. 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]
  79. Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal
    Intersection Queries in Sets of Disks. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:393-403 [Conf]
  80. Leonidas J. Guibas, Mark H. Overmars, Micha Sharir
    Intersecting Line Segments, Ray Shooting, and Other Applications of Geometric Partitioning Techniques. [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:64-73 [Conf]
  81. Mark H. Overmars
    Connectability Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:105-112 [Conf]
  82. Haijo Schipper, Mark H. Overmars
    Dynamic Partition Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:404-417 [Conf]
  83. Mark H. Overmars, Jan van Leeuwen
    Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:224-233 [Conf]
  84. Mark H. Overmars
    Scientific challenges ingame technology. [Citation Graph (0, 0)][DBLP]
    VRST, 2006, pp:1- [Conf]
  85. Mark H. Overmars
    Designing the Computational Geometry Algorithms Library CGAL. [Citation Graph (0, 0)][DBLP]
    WACG, 1996, pp:53-58 [Conf]
  86. Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold
    Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:122-134 [Conf]
  87. 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]
  88. 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]
  89. Mark de Berg, Mark H. Overmars
    Dominance in the Presence of Obstracles. [Citation Graph (0, 0)][DBLP]
    WG, 1988, pp:190-201 [Conf]
  90. Christos Levcopoulos, Mark H. Overmars
    A Balanced Search Tree with O (1) Worst-case Update Time. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1988, v:26, n:3, pp:269-277 [Journal]
  91. Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu
    Feasibility of Design in Stereolithography. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:19, n:1/2, pp:61-83 [Journal]
  92. Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld
    Efficient Ray Shooting and Hidden Surface Removal. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:1, pp:30-53 [Journal]
  93. David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars
    Searching for Empty Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1990, v:5, n:4, pp:561-571 [Journal]
  94. Mark H. Overmars, Micha Sharir
    An Improved Technique for Output-Sensitive Hidden Surface Removal. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:5, pp:469-484 [Journal]
  95. Mark H. Overmars, Nicola Santoro
    Improved Bounds for Electing a Leader in a Synchronous Ring. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:2, pp:246-262 [Journal]
  96. Rolf G. Karlsson, Mark H. Overmars
    Scanline Algorithms on a Grid. [Citation Graph (0, 0)][DBLP]
    BIT, 1988, v:28, n:2, pp:227-241 [Journal]
  97. Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal
    Intersection Queries in Sets of Disks. [Citation Graph (0, 0)][DBLP]
    BIT, 1992, v:32, n:2, pp:268-279 [Journal]
  98. Mark H. Overmars, Haijo Schipper, Micha Sharir
    Storing Line Segments in Partition Trees. [Citation Graph (0, 0)][DBLP]
    BIT, 1990, v:30, n:3, pp:385-403 [Journal]
  99. Haijo Schipper, Mark H. Overmars
    Dynamic Partition Trees. [Citation Graph (0, 0)][DBLP]
    BIT, 1991, v:31, n:3, pp:421-436 [Journal]
  100. Johan W. H. Tangelder, Joris S. M. Vergeest, Mark H. Overmars
    Interference-free NC machining using spatial planning and Minkowski operations. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 1998, v:30, n:4, pp:277-286 [Journal]
  101. Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold
    Reporting intersecting pairs of convex polytopes in two and three dimensions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:2, pp:195-207 [Journal]
  102. 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]
  103. Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
    Reconfiguring convex polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2001, v:20, n:1-2, pp:85-95 [Journal]
  104. Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars
    On R-trees with low query complexity. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:24, n:3, pp:179-195 [Journal]
  105. Mark de Berg, Marko de Groot, Mark H. Overmars
    New Results on Binary Space Partitions in the Plane. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:317-333 [Journal]
  106. Mark de Berg, Marko de Groot, Mark H. Overmars
    Perfect Binary Space Partitions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:81-91 [Journal]
  107. 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]
  108. Mark de Berg, Mark H. Overmars
    Hidden Surface Removal for C-oriented Polyhedra. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:247-268 [Journal]
  109. 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]
  110. 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]
  111. 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]
  112. Anka Gajentaan, Mark H. Overmars
    On a Class of O(n2) Problems in Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1995, v:5, n:, pp:165-185 [Journal]
  113. Leonidas J. Guibas, Mark H. Overmars, Jean-Marc Robert
    The Exact Fitting Problem in Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:215-230 [Journal]
  114. Dan Halperin, Mark H. Overmars
    Spheres, molecules, and hidden surface removal. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:11, n:2, pp:83-102 [Journal]
  115. Matthew J. Katz, Mark H. Overmars, Micha Sharir
    Efficient Hidden Surface Removal for Objects with Small Union Size. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:223-234 [Journal]
  116. Michael A. Soss, Jeff Erickson, Mark H. Overmars
    Preprocessing chains for fast dihedral rotations is hard or even impossible. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:3, pp:235-246 [Journal]
  117. 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]
  118. Mark H. Overmars, Micha Sharir
    Merging Visibility Maps. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:35-49 [Journal]
  119. Jules Vleugels, Vincenzo Ferrucci, Mark H. Overmars, Anil S. Rao
    Hunting Voronoi Vertices. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:329-354 [Journal]
  120. Mark de Berg, Dan Halperin, Mark H. Overmars
    An intersection-sensitive algorithm for snap rounding. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:3, pp:159-165 [Journal]
  121. Mark H. Overmars
    Teaching Computer Science through Game Design. [Citation Graph (0, 0)][DBLP]
    IEEE Computer, 2004, v:37, n:4, pp:81-83 [Journal]
  122. Oswin Aichholzer, Carmen Cortés, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Henk Meijer, Mark H. Overmars, Belén Palop, Suneeta Ramaswami, Godfried T. Toussaint
    Flipturning polygons [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  123. Michael A. Soss, Jeff Erickson, Mark H. Overmars
    Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  124. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
    Locked and Unlocked Polygonal Chains in 3D [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  125. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
    Locked and Unlocked Polygonal Chains in 3D [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  126. Herbert Edelsbrunner, Mark H. Overmars, Raimund Seidel
    Some methods of computational geometry applied to computer graphics. [Citation Graph (0, 0)][DBLP]
    Computer Vision, Graphics, and Image Processing, 1984, v:28, n:1, pp:92-108 [Journal]
  127. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
    Locked and Unlocked Polygonal Chains in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:3, pp:269-281 [Journal]
  128. David Eppstein, Mark H. Overmars, Günter Rote, Gerhard J. Woeginger
    Finding Minimum Area k-gons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:45-58 [Journal]
  129. Mark H. Overmars
    Finding Sets of Points without Empty Convex 6-Gons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:29, n:1, pp:153-158 [Journal]
  130. 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]
  131. Mark H. Overmars, Bertha Scholten, Ingrid Vincent
    Sets without emtpy convex 6-gons. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1989, v:37, n:, pp:160-167 [Journal]
  132. Mark H. Overmars, Emo Welzl
    A simple method for solving 2-dimensional static range searching. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1985, v:25, n:, pp:31-33 [Journal]
  133. Michiel H. M. Smid, Leen Torenvliet, Peter van Emde Boas, Mark H. Overmars
    Two Models for the Reconstruction Problem for Dynamic Data Structures. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1989, v:25, n:4, pp:131-155 [Journal]
  134. Mark de Berg, Marc J. van Kreveld, René van Oostrum, Mark H. Overmars
    Simple Traversal of a Subdivision Without Extra Storage. [Citation Graph (0, 0)][DBLP]
    International Journal of Geographical Information Science, 1997, v:11, n:4, pp:359-373 [Journal]
  135. Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars
    Output-Sensitive Methods for Rectilinear Hidden Surface Removal [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:107, n:1, pp:1-24 [Journal]
  136. Marc J. van Kreveld, Mark H. Overmars
    Concatenable Structures for Decomposable Problems [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:110, n:1, pp:130-148 [Journal]
  137. Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas
    Maintaining Multiple Representations of Dynamic Data Structures [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:83, n:2, pp:206-233 [Journal]
  138. John Adegeest, Mark H. Overmars, Jack Snoeyink
    Minimum-link C-oriented paths: Single-source queries. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1994, v:4, n:1, pp:39-51 [Journal]
  139. Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia
    The Floodlight Problem. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:1/2, pp:153-163 [Journal]
  140. Mark de Berg, Dan Halperin, Mark H. Overmars, Marc J. van Kreveld
    Sparse Arrangements and the Number of Views of Polyhedral Scenes. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:3, pp:175-195 [Journal]
  141. Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars
    Shortest path queries in rectilinear worlds. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:3, pp:287-309 [Journal]
  142. Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong
    Computing the Angularity Tolerance. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1998, v:8, n:4, pp:467-0 [Journal]
  143. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
    Separating Point Sets in Polygonal Environments. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:4, pp:403-420 [Journal]
  144. Jules Vleugels, Mark H. Overmars
    Approximating Voronoi Diagrams of Convex Sites in any Dimension. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1998, v:8, n:2, pp:201-222 [Journal]
  145. 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]
  146. Jules Vleugels, Joost N. Kok, Mark H. Overmars
    Motion Planning with Complete Knowledge Using a Colored Som. [Citation Graph (0, 0)][DBLP]
    Int. J. Neural Syst., 1997, v:8, n:5-6, pp:613-628 [Journal]
  147. Jur P. van den Berg, Mark H. Overmars
    Using Workspace Information as a Guide to Non-uniform Sampling in Probabilistic Roadmap Planners. [Citation Graph (0, 0)][DBLP]
    I. J. Robotic Res., 2005, v:24, n:12, pp:1055-1071 [Journal]
  148. 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]
  149. 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]
  150. 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]
  151. Petr Svestka, Mark H. Overmars
    Motion Planning for Carlike Robots Using a Probabilistic Learning Approach. [Citation Graph (0, 0)][DBLP]
    I. J. Robotic Res., 1997, v:16, n:2, pp:119-143 [Journal]
  152. Herbert Edelsbrunner, Mark H. Overmars
    On the Equivalence of Some Rectangle Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:14, n:3, pp:124-127 [Journal]
  153. Herbert Edelsbrunner, Mark H. Overmars
    Zooming by Repeated Range Detection. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:6, pp:413-417 [Journal]
  154. Rolf G. Karlsson, Mark H. Overmars
    Normalized Divide-and-Conquer: A Scaling Technique for Solving Multi-Dimensional Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:26, n:6, pp:307-312 [Journal]
  155. Patrick Lentfert, Mark H. Overmars
    Data Structures in a Real-Time Environment. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:31, n:3, pp:151-155 [Journal]
  156. Patrick Lentfert, Mark H. Overmars
    Data structures in a real-time environment. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:32, n:3, pp:151-155 [Journal]
  157. Kurt Mehlhorn, Mark H. Overmars
    Optimal Dynamization of Decomposable Searching Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:2, pp:93-98 [Journal]
  158. Mark H. Overmars
    General Methods for `All Elements' and `All Pairs' Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:2, pp:99-102 [Journal]
  159. Mark H. Overmars
    Point Location in Fat Subdivisions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:5, pp:261-265 [Journal]
  160. Mark H. Overmars, Jan van Leeuwen
    Further Comments on Bykat's Convex Hull Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:4/5, pp:209-212 [Journal]
  161. Mark H. Overmars, Jan van Leeuwen
    Some Principles for Dynamizing Decomposable Searching Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:1, pp:49-53 [Journal]
  162. Marc J. van Kreveld, Mark H. Overmars
    Union-Copy Structures and Dynamic Segment Trees. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:3, pp:635-652 [Journal]
  163. Mark de Berg, Svante Carlsson, Mark H. Overmars
    A General Approach to Dominance in the Plane. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:2, pp:274-296 [Journal]
  164. 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]
  165. Mark H. Overmars
    Dynamization of Order Decomposable Set Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:3, pp:245-260 [Journal]
  166. Mark H. Overmars
    Corrigendum: Dynamization of Order Decomposable Set Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1983, v:4, n:3, pp:301- [Journal]
  167. 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]
  168. Mark H. Overmars, Derick Wood
    On Rectangular Visibility. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1988, v:9, n:3, pp:372-390 [Journal]
  169. Hans W. Scholten, Mark H. Overmars
    General Methods for Adding Range Restrictions to Decomposable Searching Problems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1989, v:7, n:1, pp:1-10 [Journal]
  170. Roland Geraerts, Mark H. Overmars
    Sampling and node adding in probabilistic roadmap planners. [Citation Graph (0, 0)][DBLP]
    Robotics and Autonomous Systems, 2006, v:54, n:2, pp:165-173 [Journal]
  171. Petr Svestka, Mark H. Overmars
    Coordinated path planning for multiple robots. [Citation Graph (0, 0)][DBLP]
    Robotics and Autonomous Systems, 1998, v:23, n:3, pp:125-152 [Journal]
  172. Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf
    Computing and Verifying Depth Orders. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:2, pp:437-446 [Journal]
  173. Dan Halperin, Mark H. Overmars, Micha Sharir
    Efficient Motion Planning for an L-Shaped Object. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:1, pp:1-23 [Journal]
  174. Mark H. Overmars, Chee-Keng Yap
    New Upper Bounds in Klee's Measure Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:6, pp:1034-1045 [Journal]
  175. Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir
    Computing Maximally Separated Sets in the Plane. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:3, pp:815-834 [Journal]
  176. Mark de Berg, Leonidas J. Guibas, Dan Halperin, Mark H. Overmars, Otfried Schwarzkopf, Micha Sharir, Monique Teillaud
    Reaching a Goal with Directional Uncertainty. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:140, n:2, pp:301-317 [Journal]
  177. Micha Sharir, Mark H. Overmars
    A Simple Output-Sensitive Algorithm for Hidden Surface Removal. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Graph., 1992, v:11, n:1, pp:1-11 [Journal]
  178. Roland Geraerts, Mark H. Overmars
    The Corridor Map Method: Real-Time High-Quality Path Planning. [Citation Graph (0, 0)][DBLP]
    ICRA, 2007, pp:1023-1028 [Conf]
  179. Jur P. van den Berg, Mark H. Overmars
    Using Workspace Information as a Guide to Non-uniform Sampling in Probabilistic Roadmap Planners. [Citation Graph (0, 0)][DBLP]
    ICRA, 2004, pp:453-460 [Conf]
  180. Dennis Nieuwenhuisen, Mark H. Overmars
    Useful Cycles in Probabilistic Roadmap Graphs. [Citation Graph (0, 0)][DBLP]
    ICRA, 2004, pp:446-452 [Conf]
  181. Roland Geraerts, Mark H. Overmars
    Clearance based Path Optimization for Motion Planning. [Citation Graph (0, 0)][DBLP]
    ICRA, 2004, pp:2386-2392 [Conf]
  182. Arno Kamphuis, Mark H. Overmars
    Motion Planning for Coherent Groups of Entities. [Citation Graph (0, 0)][DBLP]
    ICRA, 2004, pp:3815-3822 [Conf]
  183. Dennis Nieuwenhuisen, Mark H. Overmars
    Motion Planning for Camera Movements. [Citation Graph (0, 0)][DBLP]
    ICRA, 2004, pp:3870-3876 [Conf]
  184. Roland Geraerts, Mark H. Overmars
    Reachability Analysis of Sampling Based Planners. [Citation Graph (0, 0)][DBLP]
    ICRA, 2005, pp:404-410 [Conf]
  185. Johannes A. La Poutré, Jan van Leeuwen, Mark H. Overmars
    Maintenance of 2- and 3-edge- connected components of graphs I. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:329-359 [Journal]
  186. Roland Geraerts, Mark H. Overmars
    Reachability-based analysis for Probabilistic Roadmap planners. [Citation Graph (0, 0)][DBLP]
    Robotics and Autonomous Systems, 2007, v:55, n:11, pp:824-836 [Journal]
  187. Dennis Nieuwenhuisen, Arno Kamphuis, Mark H. Overmars
    High quality navigation in computer games. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2007, v:67, n:1, pp:91-104 [Journal]

  188. Range searching in a set of line segments. [Citation Graph (, )][DBLP]


  189. The complexity of cutting paper (extended abstract). [Citation Graph (, )][DBLP]


  190. Computing Shortest Safe Path amidst Growing Discs in the Plane. [Citation Graph (, )][DBLP]


  191. Flexible Path Planning Using Corridor Maps. [Citation Graph (, )][DBLP]


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


  193. A Velocity-Based Approach for Simulating Human Collision Avoidance. [Citation Graph (, )][DBLP]


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


  195. Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles. [Citation Graph (, )][DBLP]


  196. Kinodynamic motion planning on roadmaps in dynamic environments. [Citation Graph (, )][DBLP]


  197. Efficient path planning in changing environments. [Citation Graph (, )][DBLP]


  198. Creating High-quality Roadmaps for Motion Planning in Virtual Environments. [Citation Graph (, )][DBLP]


  199. Using the Corridor Map Method for Path Planning for a Large Number of Characters. [Citation Graph (, )][DBLP]


  200. A Predictive Collision Avoidance Model for Pedestrian Simulation. [Citation Graph (, )][DBLP]


  201. Indicative routes for path planning and crowd simulation. [Citation Graph (, )][DBLP]


Search in 0.011secs, Finished in 0.022secs
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