default search action
Mark H. Overmars
Person information
- affiliation: Utrecht University, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2013
- [b4]Arjan Egges, Jeroen Fokker, Mark H. Overmars:
Learning C# by Programming Games. Springer 2013, ISBN 978-3-642-36579-9, pp. I-XXII, 1-443 - 2012
- [j114]Anka Gajentaan, Mark H. Overmars:
On a class of O(n2) problems in computational geometry. Comput. Geom. 45(4): 140-152 (2012) - [j113]Ioannis Karamouzas, Mark H. Overmars:
Simulating and Evaluating the Local Behavior of Small Pedestrian Groups. IEEE Trans. Vis. Comput. Graph. 18(3): 394-406 (2012) - 2011
- [j112]Greg Aloupis, Prosenjit Bose
, Erik D. Demaine, Stefan Langerman
Computing Signed Permutations of Polygons. Int. J. Comput. Geom. Appl. 21(1): 87-100 (2011) - [c114]Thomas Geijtenbeek, Nicolas Pronost, Arjan Egges, Mark H. Overmars:
Interactive Character Animation using Simulated Physics. Eurographics (State of the Art Reports) 2011: 127-149 - 2010
- [j111]Herwin van Welbergen, Ben J. H. van Basten, Arjan Egges, Zsófia Ruttkay, Mark H. Overmars:
Real Time Animation of Virtual Humans: A Trade-off Between Naturalness and Control. Comput. Graph. Forum 29(8): 2530-2554 (2010) - [c113]Ioannis Karamouzas, Mark H. Overmars:
A Velocity-Based Approach for Simulating Human Collision Avoidance. IVA 2010: 180-186 - [c112]Ioannis Karamouzas, Mark H. Overmars:
Simulating Human Collision Avoidance Using a Velocity-Based Approach. VRIPHYS 2010: 125-134 - [c111]Ioannis Karamouzas, Mark H. Overmars:
Simulating the local behaviour of small pedestrian groups. VRST 2010: 183-190
2000 – 2009
- 2009
- [j110]Arjan Egges, Arno Kamphuis, Mark H. Overmars:
Guest editors' introduction: Special issue on gaming. Comput. Animat. Virtual Worlds 20(5-6) (2009) - [c110]Herwin van Welbergen, Ben J. H. van Basten, Arjan Egges, Zsófia Ruttkay, Mark H. Overmars:
Real Time Animation of Virtual Humans: A Trade-off Between Naturalness and Control. Eurographics (State of the Art Reports) 2009: 45-72 - [c109]Ioannis Karamouzas, Roland Geraerts
Indicative routes for path planning and crowd simulation. FDG 2009: 113-120 - [c108]Ioannis Karamouzas, Jiri Bakker, Mark H. Overmars:
Density constraints for crowd simulation. ICE-GIC 2009: 160-168 - [c107]Ioannis Karamouzas, Peter Heil, Pascal van Beek, Mark H. Overmars:
A Predictive Collision Avoidance Model for Pedestrian Simulation. MIG 2009: 41-52 - [e3]Arjan Egges, Roland Geraerts, Mark H. Overmars:
Motion in Games, Second International Workshop, MIG 2009, Zeist, The Netherlands, November 21-24, 2009. Proceedings. Lecture Notes in Computer Science 5884, Springer 2009, ISBN 978-3-642-10346-9 [contents] - 2008
- [b3]Mark de Berg, Otfried Cheong, Marc J. van Kreveld, Mark H. Overmars:
Computational geometry: algorithms and applications, 3rd Edition. Springer 2008, ISBN 9783540779735, pp. I-XII, 1-386 - [j109]Jur P. van den Berg, Mark H. Overmars:
Planning Time-Minimal Safe Paths Amidst Unpredictably Moving Obstacles. Int. J. Robotics Res. 27(11-12): 1274-1294 (2008) - [j108]Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin
Realizing partitions respecting full and partial order information. J. Discrete Algorithms 6(1): 51-58 (2008) - [j107]Ioannis Karamouzas, Mark H. Overmars:
Adding variation to path planning. Comput. Animat. Virtual Worlds 19(3-4): 283-293 (2008) - [c106]Mark H. Overmars, Ioannis Karamouzas, Roland Geraerts:
Flexible Path Planning Using Corridor Maps. ESA 2008: 1-12 - [c105]Roland Geraerts, Arno Kamphuis, Ioannis Karamouzas, Mark H. Overmars:
Using the Corridor Map Method for Path Planning for a Large Number of Characters. MIG 2008: 11-22 - [e2]Arjan Egges, Arno Kamphuis, Mark H. Overmars:
Motion in Games, First International Workshop, MIG 2008, Utrecht, The Netherlands, June 14-17, 2008. Revised Papers. Lecture Notes in Computer Science 5277, Springer 2008, ISBN 978-3-540-89219-9 [contents] - 2007
- [j106]Mark de Berg, Dan Halperin, Mark H. Overmars:
An intersection-sensitive algorithm for snap rounding. Comput. Geom. 36(3): 159-165 (2007) - [j105]Jae-Sook Cheong, A. Frank van der Stappen
Immobilizing Hinged Polygons. Int. J. Comput. Geom. Appl. 17(1): 45-70 (2007) - [j104]Roland Geraerts
Creating High-quality Paths for Motion Planning. Int. J. Robotics Res. 26(8): 845-863 (2007) - [j103]Roland Geraerts
The corridor map method: a general framework for real-time high-quality path planning. Comput. Animat. Virtual Worlds 18(2): 107-119 (2007) - [j102]Roland Geraerts
Reachability-based analysis for Probabilistic Roadmap planners. Robotics Auton. Syst. 55(11): 824-836 (2007) - [j101]Dennis Nieuwenhuisen, Arno Kamphuis, Mark H. Overmars:
High quality navigation in computer games. Sci. Comput. Program. 67(1): 91-104 (2007) - [j100]Dennis Nieuwenhuisen, A. Frank van der Stappen
Pushing a Disk Using Compliance. IEEE Trans. Robotics 23(3): 431-442 (2007) - [c104]Roland Geraerts
The Corridor Map Method: Real-Time High-Quality Path Planning. ICRA 2007: 1023-1028 - [c103]Dennis Nieuwenhuisen, Jur P. van den Berg, Mark H. Overmars:
Efficient path planning in changing environments. IROS 2007: 3295-3301 - [c102]Jur P. van den Berg, Mark H. Overmars:
Kinodynamic motion planning on roadmaps in dynamic environments. IROS 2007: 4253-4258 - 2006
- [b2]Jacob Habgood, Mark H. Overmars:
The game maker's apprentice - game development for beginners. Apress 2006, ISBN 978-1-59059-615-9, pp. I-XX, 1-311 - [j99]Roland Geraerts
Sampling and node adding in probabilistic roadmap planners. Robotics Auton. Syst. 54(2): 165-173 (2006) - [j98]Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir:
Computing Maximally Separated Sets in the Plane. SIAM J. Comput. 36(3): 815-834 (2006) - [c101]Dennis Nieuwenhuisen, A. Frank van der Stappen
Pushing using Compliance. ICRA 2006: 2010-2016 - [c100]Roland Geraerts
Creating High-quality Roadmaps for Motion Planning in Virtual Environments. IROS 2006: 4355-4361 - [c99]Mark H. Overmars:
Scientific challenges ingame technology. VRST 2006: 1 - [c98]Dennis Nieuwenhuisen, A. Frank van der Stappen
An Effective Framework for Path Planning Amidst Movable Obstacles. WAFR 2006: 87-102 - [c97]Jur P. van den Berg, Mark H. Overmars:
Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles. WAFR 2006: 103-118 - [i7]Jur P. van den Berg, Mark H. Overmars:
Computing Shortest Safe Path amidst Growing Discs in the Plane. Robot Navigation 2006 - 2005
- [j97]Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman
Separating Point Sets in Polygonal Environments. Int. J. Comput. Geom. Appl. 15(4): 403-420 (2005) - [j96]Michael A. Erdmann, David Hsu, Mark H. Overmars, A. Frank van der Stappen
Editorial: Special Issue on WAFR 2004. Int. J. Robotics Res. 24(11): 881-882 (2005) - [j95]Jur P. van den Berg, Mark H. Overmars:
Using Workspace Information as a Guide to Non-uniform Sampling in Probabilistic Roadmap Planners. Int. J. Robotics Res. 24(12): 1055-1071 (2005) - [j94]Mark de Berg, Joachim Gudmundsson
TSP with neighborhoods of varying size. J. Algorithms 57(1): 22-36 (2005) - [j93]Jur P. van den Berg, Mark H. Overmars:
Roadmap-based motion planning in dynamic environments. IEEE Trans. Robotics 21(5): 885-897 (2005) - [c96]Roland Geraerts
Reachability Analysis of Sampling Based Planners. ICRA 2005: 404-410 - [c95]Jur P. van den Berg, Mark H. Overmars:
Prioritized motion planning for multiple robots. IROS 2005: 430-435 - [c94]Roland Geraerts
On improving the clearance for robots in high-dimensional configuration spaces. IROS 2005: 679-684 - [c93]Dennis Nieuwenhuisen, A. Frank van der Stappen
Path planning for pushing a disk using compliance. IROS 2005: 714-720 - [c92]Jur P. van den Berg, Dennis Nieuwenhuisen, Leonard Jaillet, Mark H. Overmars:
Creating robust roadmaps for motion planning in changing environments. IROS 2005: 1053-1059 - [e1]Michael A. Erdmann, Mark H. Overmars, David Hsu, A. Frank van der Stappen:
Algorithmic Foundations of Robotics VI, Selected Contributions of the Sixth International Workshop on the Algorithmic Foundations of Robotics, WAFR 2004, July 11-13, 2004, Zeist, the Netherlands. Springer Tracts in Advanced Robotics 17, Springer 2005, ISBN 978-3-540-25728-8 [contents] - 2004
- [j92]Mark H. Overmars:
Teaching Computer Science through Game Design. Computer 37(4): 81-83 (2004) - [c91]Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides:
Separating point sets in polygonal environments. SCG 2004: 10-16 - [c90]Dennis Nieuwenhuisen, Mark H. Overmars:
Useful Cycles in Probabilistic Roadmap Graphs. ICRA 2004: 446-452 - [c89]Jur P. van den Berg, Mark H. Overmars:
Using Workspace Information as a Guide to Non-uniform Sampling in Probabilistic Roadmap Planners. ICRA 2004: 453-460 - [c88]Roland Geraerts, Mark H. Overmars:
Clearance based Path Optimization for Motion Planning. ICRA 2004: 2386-2392 - [c87]Arno Kamphuis, Mark H. Overmars:
Motion Planning for Coherent Groups of Entities. ICRA 2004: 3815-3822 - [c86]Dennis Nieuwenhuisen, Mark H. Overmars:
Motion Planning for Camera Movements. ICRA 2004: 3870-3876 - [c85]Jur P. van den Berg, Mark H. Overmars:
Roadmap-based motion planning in dynamic environments. IROS 2004: 1598-1605 - [c84]Arno Kamphuis, Mark H. Overmars:
Finding paths for coherent groups using clearance. Symposium on Computer Animation 2004: 19-28 - [c83]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. SODA 2004: 516-525 - [c82]Onno C. Goemans, Mark H. Overmars:
Automatic Generation of Camera Motion to Track a Moving Guide. WAFR 2004: 187-202 - 2003
- [j91]Mark de Berg, Joachim Gudmundsson
On R-trees with low query complexity. Comput. Geom. 24(3): 179-195 (2003) - [j90]Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen
Guarding scenes against invasive hypercubes. Comput. Geom. 26(2): 99-117 (2003) - [j89]Michael A. Soss, Jeff Erickson, Mark H. Overmars:
Preprocessing chains for fast dihedral rotations is hard or even impossible. Comput. Geom. 26(3): 235-246 (2003) - [j88]Mark H. Overmars:
Finding Sets of Points without Empty Convex 6-Gons. Discret. Comput. Geom. 29(1): 153-158 (2003) - 2002
- [j87]Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen
Orienting polyhedral parts by pushing. Comput. Geom. 21(1-2): 21-38 (2002) - [j86]Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen
Models and motion planning. Comput. Geom. 23(1): 53-68 (2002) - [j85]Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled
Reporting intersecting pairs of convex polytopes in two and three dimensions. Comput. Geom. 23(2): 195-207 (2002) - [j84]Oswin Aichholzer, Carmen Cortés
Flipturning Polygons. Discret. Comput. Geom. 28(2): 231-253 (2002) - [c81]Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint:
Computing signed permutations of polygons. CCCG 2002: 68-71 - [c80]Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos
TSP with Neighborhoods of Varying Size. ESA 2002: 187-199 - [c79]Mark H. Overmars:
Recent Developments in Motion Planning. International Conference on Computational Science (3) 2002: 3-13 - [c78]Jae-Sook Cheong, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen
Fixturing Hinged Polygons. ICRA 2002: 876-881 - [c77]Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen
Sensorless Orientation of 3D Polyhedral Parts. ICRA 2002: 2016-2021 - [c76]Greg Aloupis, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Stefan Langerman
Flat-State Connectivity of Linkages under Dihedral Motions. ISAAC 2002: 369-380 - [c75]Mark H. Overmars:
Algorithms for Motion and Navigation in Virtual Environments and Games. WAFR 2002: 1-6 - [c74]Roland Geraerts
A Comparative Study of Probabilistic Roadmap Planners. WAFR 2002: 43-58 - [i6]Michael A. Soss, Jeff Erickson, Mark H. Overmars:
Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible. CoRR cs.CG/0204042 (2002) - 2001
- [j83]Oswin Aichholzer
Reconfiguring convex polygons. Comput. Geom. 20(1-2): 85-95 (2001) - [j82]Therese 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. Discret. Comput. Geom. 26(3): 269-281 (2001) - [j81]Robert-Paul Berretty, Kenneth Y. Goldberg
Trap Design for Vibratory Bowl Feeders. Int. J. Robotics Res. 20(11): 891-908 (2001) - [j80]Mike Tao Zhang, Kenneth Y. Goldberg
Pin design for part feeding. Robotica 19(6): 695-702 (2001) - [c73]Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen
Orienting Parts by Inside-out Pulling. ICRA 2001: 1053-1058 - [c72]Danielle Sent, Mark H. Overmars:
Motion Planning in Environments with Dangerzones. ICRA 2001: 1488-1493 - [c71]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. WADS 2001: 122-134 - 2000
- [j79]A. Frank van der Stappen
Computing Immobilizing Grasps of Polygonal Parts. Int. J. Robotics Res. 19(5): 467-479 (2000) - [c70]Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint:
Reconfiguring Convex Polygons. CCCG 2000 - [c69]A. Frank van der Stappen, Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars:
Geometry and Part Feeding. Sensor Based Intelligent Robots 2000: 259-281 - [c68]Michiel Hagedoorn, Mark H. Overmars, Remco C. Veltkamp:
A New Visibility Partition for Affine Pattern Matching. DGCI 2000: 358-370 - [c67]Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars:
On R-trees with Low Stabbing Number. ESA 2000: 167-178 - [c66]Mike Tao Zhang, Gordon Smith, Robert-Paul Berretty, Mark H. Overmars, Kenneth Y. Goldberg:
The Toppling Graph: Designing Pin Sequences for Part Feeding. ICRA 2000: 139-146 - [i5]Michiel Hagedoorn, Mark H. Overmars, Remco C. Veltkamp:
A Robust Affine Invariant Similarity Measure Based on Visibility. EuroCG 2000: 112-116 - [i4]Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen:
Orienting Polyhedral Parts by Pushing. EuroCG 2000: 136-139 - [i3]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. CoRR cs.CG/0008010 (2000)
1990 – 1999
- 1999
- [c65]Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen:
Geometric Algorithms for Trap Design. SCG 1999: 95-104 - [c64]Valérie Boor, Mark H. Overmars, A. Frank van der Stappen:
The Gaussian Sampling Strategy for Probabilistic Roadmap Planners. ICRA 1999: 1018-1023 - [c63]A. Frank van der Stappen, Chantal Wentink, Mark H. Overmars:
Computing Form-Closure Configurations. ICRA 1999: 1837-1842 - [c62]Robert-Paul Berretty, Kenneth Y. Goldberg, Lawrence Cheung, Mark H. Overmars, Gordon Smith, A. Frank van der Stappen:
Trap Design for Vibratory Bowl Feeders. ICRA 1999: 2558-2563 - [c61]Therese 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. SODA 1999: 866-867 - [i2]Therese 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. CoRR cs.CG/9910009 (1999) - 1998
- [j78]Johan W. H. Tangelder, Joris S. M. Vergeest, Mark H. Overmars:
Interference-free NC machining using spatial planning and Minkowski operations. Comput. Aided Des. 30(4): 277-286 (1998) - [j77]Robert-Paul Berretty, Kenneth Y. Goldberg
Computing fence designs for orienting parts. Comput. Geom. 10(4): 249-262 (1998) - [j76]Dan Halperin, Mark H. Overmars:
Spheres, molecules, and hidden surface removal. Comput. Geom. 11(2): 83-102 (1998) - [j75]Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen
Dynamic motion planning in low obstacle density environments. Comput. Geom. 11(3-4): 157-173 (1998) - [j74]A. Frank van der Stappen
Motion Planning in Environments with Low Obstacle Density. Discret. Comput. Geom. 20(4): 561-587 (1998) - [j73]Jules Vleugels, Mark H. Overmars:
Approximating Voronoi Diagrams of Convex Sites in any Dimension. Int. J. Comput. Geom. Appl. 8(2): 201-222 (1998) - [j72]Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong:
Computing the Angularity Tolerance. Int. J. Comput. Geom. Appl. 8(4): 467-482 (1998) - [j71]Sepanta Sekhavat, Petr Svestka, Jean-Paul Laumond, Mark H. Overmars:
Multilevel Path Planning for Nonholonomic Robots Using Semiholonomic Subsystems. Int. J. Robotics Res. 17(8): 840-857 (1998) - [j70]Petr Svestka, Mark H. Overmars:
Coordinated path planning for multiple robots. Robotics Auton. Syst. 23(3): 125-152 (1998) - [c60]Therese 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. CCCG 1998 - [c59]Mark H. Overmars:
Geometric Algorithms for Robotic Manipulation. ICALP 1998: 116-117 - [c58]Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen
Models and Motion Planning. SWAT 1998: 83-94 - [c57]Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels:
Guarding Scenes against Invasive Hypercubes. WAE 1998: 110-120 - [i1]Therese 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. CoRR cs.CG/9811019 (1998) - 1997
- [j69]Mark H. Overmars, Nicola Santoro
Improved Bounds for Electing a Leader in a Synchronous Ring. Algorithmica 18(2): 246-262 (1997) - [j68]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. Algorithmica 19(1/2): 61-83 (1997) - [j67]Mark de Berg, Marko de Groot, Mark H. Overmars:
Perfect Binary Space Partitions. Comput. Geom. 7: 81-91 (1997) - [j66]Mark de Berg, Marko de Groot, Mark H. Overmars:
New Results on Binary Space Partitions in the Plane. Comput. Geom. 8: 317-333 (1997) - [j65]Mark de Berg, Marc J. van Kreveld, René van Oostrum, Mark H. Overmars:
Simple Traversal of a Subdivision Without Extra Storage. Int. J. Geogr. Inf. Sci. 11(4): 359-373 (1997) - [j64]Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia:
The Floodlight Problem. Int. J. Comput. Geom. Appl. 7(1/2): 153-163 (1997) - [j63]Mark de Berg, Dan Halperin, Mark H. Overmars, Marc J. van Kreveld:
Sparse Arrangements and the Number of Views of Polyhedral Scenes. Int. J. Comput. Geom. Appl. 7(3): 175-195 (1997) - [j62]Jules Vleugels, Joost N. Kok, Mark H. Overmars:
Motion Planning with Complete Knowledge Using a Colored Som. Int. J. Neural Syst. 8(5-6): 613-628 (1997) - [j61]Petr Svestka, Mark H. Overmars:
Motion Planning for Carlike Robots Using a Probabilistic Learning Approach. Int. J. Robotics Res. 16(2): 119-143 (1997) - [c56]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. SCG 1997: 21-29 - [c55]Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen:
Dynamic Motion Planning in Low Obstacle Density Environments. WADS 1997: 3-16 - 1996
- [j60]Leonidas J. Guibas, Mark H. Overmars, Jean-Marc Robert:
The Exact Fitting Problem in Higher Dimensions. Comput. Geom. 6: 215-230 (1996) - [j59]Jules Vleugels, Vincenzo Ferrucci, Mark H. Overmars, Anil S. Rao:
Hunting Voronoi Vertices. Comput. Geom. 6: 329-354 (1996) - [j58]Mark H. Overmars, A. Frank van der Stappen
Range Searching and Point Location among Fat Objects. J. Algorithms 21(3): 629-656 (1996) - [j57]Lydia E. Kavraki
Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robotics Autom. 12(4): 566-580 (1996) - [c54]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. CCCG 1996: 325-330 - [c53]Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong:
Computing the Angularity Tolerance. CCCG 1996: 331-336 - [c52]Mark de Berg, René van Oostrum, Mark H. Overmars:
Simple Traversal of a Subdivision Without Extra Storage. SCG 1996: C-5-C-6 - [c51]Chantal Wentink, A. Frank van der Stappen, Mark H. Overmars:
Fixture Design with Edge-Fixels. Intelligent Robots 1996: 269-286 - [c50]Mark H. Overmars, Petr Svestka:
Probabilistic Approaches to Motion Planning. SOFSEM 1996: 95-112 - [c49]Mark H. Overmars:
Designing the Computational Geometry Algorithms Library CGAL. WACG 1996: 53-58 - 1995
- [j56]Anka Gajentaan, Mark H. Overmars:
On a Class of O(n2) Problems in Computational Geometry. Comput. Geom. 5: 165-185 (1995) - [j55]Mark de Berg, Leonidas J. Guibas, Dan Halperin, Mark H. Overmars, Otfried Schwarzkopf, Micha Sharir, Monique Teillaud:
Reaching a Goal with Directional Uncertainty. Theor. Comput. Sci. 140(2): 301-317 (1995) - [c48]Mark H. Overmars, Anil S. Rao, Otfried Schwarzkopf, Chantal Wentink:
Immobilizing Polygons against a Wall. SCG 1995: 29-38 - [c47]Berto van de Kraats, Marc J. van Kreveld, Mark H. Overmars:
Printed Circuit Board Simplification: Simplifying Subdivisions in Practice. SCG 1995: C30-C31 - [c46]Mark de Berg, Marc J. van Kreveld, René van Oostrum, Mark H. Overmars:
Simple Traversal of a Subdivision Without Extra Storage. ACM-GIS 1995: 77- - [c45]Petr Svestka, Mark H. Overmars:
Coordinated Motion Planning for Multiple Car-Like Robots Using Probabilistic Roadmaps. ICRA 1995: 1631-1636 - 1994
- [j54]Mark H. Overmars, Micha Sharir:
An Improved Technique for Output-Sensitive Hidden Surface Removal. Algorithmica 11(5): 469-484 (1994) - [j53]Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld:
Efficient Ray Shooting and Hidden Surface Removal. Algorithmica 12(1): 30-53 (1994) - [j52]Marc J. van Kreveld, Mark H. Overmars:
Concatenable Structures for Decomposable Problems. Inf. Comput. 110(1): 130-148 (1994) - [j51]John Adegeest, Mark H. Overmars, Jack Snoeyink:
Minimum-link C-oriented paths: Single-source queries. Int. J. Comput. Geom. Appl. 4(1): 39-51 (1994) - [j50]Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf:
Computing and Verifying Depth Orders. SIAM J. Comput. 23(2): 437-446 (1994) - [c44]Vincenzo Ferrucci, Mark H. Overmars, Anil S. Rao, Jules Vleugels:
Hunting Voronoi Vertices in Non-Polygonal Domains. CCCG 1994: 45-50 - [c43]A. Frank van der Stappen, Mark H. Overmars:
Motion Planning Amidst Fat Obstacles (Extended Abstract). SCG 1994: 31-40 - [c42]Dan Halperin, Mark H. Overmars:
Spheres, Molecules, and Hidden Surface Removal. SCG 1994: 113-122 - [c41]Mark H. Overmars, A. Frank van der Stappen:
Range Searching and Point Location among Fat Objects. ESA 1994: 240-253 - [c40]Mark de Berg, Marko de Groot, Mark H. Overmars:
New Results on Binary Space Partitions in the Plane (Extended Abstract). SWAT 1994: 61-72 - 1993
- [j49]A. Frank van der Stappen
The Complexity of the Free Space for a Robot Moving Amidst Fat Obstacles. Comput. Geom. 3: 353-373 (1993) - [j48]Johannes A. La Poutré, Jan van Leeuwen, Mark H. Overmars:
Maintenance of 2- and 3-edge- connected components of graphs I. Discret. Math. 114(1-3): 329-359 (1993) - [j47]Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars:
Output-Sensitive Methods for Rectilinear Hidden Surface Removal. Inf. Comput. 107(1): 1-24 (1993) - [j46]Marc J. van Kreveld, Mark H. Overmars:
Union-Copy Structures and Dynamic Segment Trees. J. ACM 40(3): 635-652 (1993) - [j45]Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars:
Intersection Queries in Curved Objects. J. Algorithms 15(2): 229-266 (1993) - [c39]Mark de Berg, Marko de Groot, Mark H. Overmars:
Perfect Binary Space Partitions. CCCG 1993: 109-114 - [c38]Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia:
The Floodlight Problem. CCCG 1993: 399-404 - [c37]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. FSTTCS 1993: 228-237 - [c36]A. Frank van der Stappen, Dan Halperin, Mark H. Overmars:
Efficient Algorithms for Exact Motion Planning Amidst Fat Obstacles. ICRA (1) 1993: 297-304 - [c35]Mark de Berg, Mark H. Overmars, Leonidas J. Guibas, Otfried Schwarzkopf, Monique Teillaud, Dan Halperin, Micha Sharir:
Reaching a Goal with Directional Uncertainty. ISAAC 1993: 1-10 - 1992
- [j44]Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal:
Intersection Queries in Sets of Disks. BIT 32(2): 268-279 (1992) - [j43]Matthew J. Katz, Mark H. Overmars, Micha Sharir:
Efficient Hidden Surface Removal for Objects with Small Union Size. Comput. Geom. 2: 223-234 (1992) - [j42]David Eppstein, Mark H. Overmars, Günter Rote, Gerhard J. Woeginger:
Finding Minimum Area k-gons. Discret. Comput. Geom. 7: 45-58 (1992) - [j41]Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars:
Shortest path queries in rectilinear worlds. Int. J. Comput. Geom. Appl. 2(3): 287-309 (1992) - [j40]Mark H. Overmars:
Point Location in Fat Subdivisions. Inf. Process. Lett. 44(5): 261-265 (1992) - [j39]Mark de Berg, Svante Carlsson, Mark H. Overmars:
A General Approach to Dominance in the Plane. J. Algorithms 13(2): 274-296 (1992) - [j38]Dan Halperin, Mark H. Overmars, Micha Sharir:
Efficient Motion Planning for an L-Shaped Object. SIAM J. Comput. 21(1): 1-23 (1992) - [j37]Micha Sharir, Mark H. Overmars:
A Simple Output-Sensitive Algorithm for Hidden Surface Removal. ACM Trans. Graph. 11(1): 1-11 (1992) - [c34]Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf:
Computing and Verifying Depth Orders. SCG 1992: 138-145 - 1991
- [j36]Marc J. van Kreveld, Mark H. Overmars:
Divided k-d Trees. Algorithmica 6(6): 840-858 (1991) - [j35]Haijo Schipper, Mark H. Overmars:
Dynamic Partition Trees. BIT 31(3): 421-436 (1991) - [j34]Mark H. Overmars, Micha Sharir:
Merging Visibility Maps. Comput. Geom. 1: 35-49 (1991) - [j33]Mark de Berg, Mark H. Overmars:
Hidden Surface Removal for C-oriented Polyhedra. Comput. Geom. 1: 247-268 (1991) - [j32]Mark H. Overmars, Chee-Keng Yap:
New Upper Bounds in Klee's Measure Problem. SIAM J. Comput. 20(6): 1034-1045 (1991) - [c33]Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld:
Efficient Ray Shooting and Hidden Surface Removal. SCG 1991: 21-30 - [c32]Matthew J. Katz, Mark H. Overmars, Micha Sharir:
Efficient Hidden Surface Removal for Objects with small Union Size. SCG 1991: 31-40 - [c31]Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars:
Intersection Queries for Curved Objects (Extended Abstract). SCG 1991: 41-50 - 1990
- [j31]Mark H. Overmars, Michiel H. M. Smid, Mark de Berg, Marc J. van Kreveld:
Maintaining Range Trees in Secondary Memory. Part I: Partitions. Acta Informatica 27(5): 423-452 (1990) - [j30]Michiel H. M. Smid, Mark H. Overmars:
Maintaining Range Trees in Secondary Memory. Part II: Lower Bounds. Acta Informatica 27(5): 453-480 (1990) - [j29]David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars:
Searching for Empty Convex Polygons. Algorithmica 5(4): 561-571 (1990) - [j28]Mark H. Overmars, Haijo Schipper, Micha Sharir:
Storing Line Segments in Partition Trees. BIT 30(3): 385-403 (1990) - [j27]Herbert Edelsbrunner, Mark H. Overmars, Emo Welzl, Irith Ben-Arroyo Hartman, Jack A. Feldman:
Ranking intervals under visibility constraints. Int. J. Comput. Math. 34(3-4): 129-144 (1990) - [c30]Mark H. Overmars, Micha Sharir:
Merging Visibility Maps. SCG 1990: 168-176 - [c29]Mark de Berg, Mark H. Overmars:
Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract). FOCS 1990: 252-261 - [c28]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). ICALP 1990: 689-702 - [c27]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. SWAT 1990: 213-224 - [c26]Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal:
Intersection Queries in Sets of Disks. SWAT 1990: 393-403 - [c25]Haijo Schipper, Mark H. Overmars:
Dynamic Partition Trees. SWAT 1990: 404-417
1980 – 1989
- 1989
- [j26]Mark H. Overmars, Bertha Scholten, Ingrid Vincent:
Sets without emtpy convex 6-gons. Bull. EATCS 37: 160-167 (1989) - [j25]Michiel H. M. Smid, Leen Torenvliet, Peter van Emde Boas, Mark H. Overmars:
Two Models for the Reconstruction Problem for Dynamic Data Structures. J. Inf. Process. Cybern. 25(4): 131-155 (1989) - [j24]Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas:
Maintaining Multiple Representations of Dynamic Data Structures. Inf. Comput. 83(2): 206-233 (1989) - [j23]Patrick Lentfert, Mark H. Overmars:
Data Structures in a Real-Time Environment. Inf. Process. Lett. 31(3): 151-155 (1989) - [j22]Hans W. Scholten, Mark H. Overmars:
General Methods for Adding Range Restrictions to Decomposable Searching Problems. J. Symb. Comput. 7(1): 1-10 (1989) - [c24]Dan Halperin, Mark H. Overmars:
Efficient Motion Planning for an L-Shaped Object. SCG 1989: 156-166 - [c23]Mark H. Overmars:
Computational Geometry and its Application to Computer Graphics. Advances in Computer Graphics 1989: 75-107 - [c22]Mark H. Overmars, Micha Sharir:
Output-Sensitive Hidden Surface Removal. FOCS 1989: 598-603 - [c21]Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas:
Multiple Representations of Dynamic Data Structures. IFIP Congress 1989: 437-442 - [c20]Mark H. Overmars, Nicola Santoro:
TIME vs BITS. STACS 1989: 282-293 - [c19]Marc J. van Kreveld, Mark H. Overmars:
Concatenable Segment Trees (Extended Abstract). STACS 1989: 493-504 - 1988
- [j21]Christos Levcopoulos, Mark H. Overmars:
A Balanced Search Tree with O (1) Worst-case Update Time. Acta Informatica 26(3): 269-277 (1988) - [j20]Rolf G. Karlsson, Mark H. Overmars:
Scanline Algorithms on a Grid. BIT 28(2): 227-241 (1988) - [j19]Rolf G. Karlsson, Mark H. Overmars:
Normalized Divide-and-Conquer: A Scaling Technique for Solving Multi-Dimensional Problems. Inf. Process. Lett. 26(6): 307-312 (1988) - [j18]Mark H. Overmars:
Efficient Data Structures for Range Searching on a Grid. J. Algorithms 9(2): 254-275 (1988) - [j17]Mark H. Overmars, Derick Wood:
On Rectangular Visibility. J. Algorithms 9(3): 372-390 (1988) - [c18]Mark H. Overmars, Emo Welzl:
New Methods for Computing Visibility Graphs. SCG 1988: 164-171 - [c17]David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars:
Searching for Empty Convex Polygons. SCG 1988: 224-228 - [c16]Mark H. Overmars, Chee-Keng Yap:
New upper bounds in Klee's measure problem (extended abstract). FOCS 1988: 550-556 - [c15]Mark H. Overmars, Michiel H. M. Smid:
Maintaining Range Trees in Secondary Memory (Extended Abstract). STACS 1988: 38-51 - [c14]Leonidas J. Guibas, Mark H. Overmars, Micha Sharir:
Intersecting Line Segments, Ray Shooting, and Other Applications of Geometric Partitioning Techniques. SWAT 1988: 64-73 - [c13]Mark H. Overmars:
Connectability Problems. SWAT 1988: 105-112 - [c12]Mark de Berg, Mark H. Overmars:
Dominance in the Presence of Obstracles. WG 1988: 190-201 - 1987
- [j16]Herbert Edelsbrunner, Mark H. Overmars:
Zooming by Repeated Range Detection. Inf. Process. Lett. 24(6): 413-417 (1987) - [c11]J. Ian Munro, Mark H. Overmars, Derick Wood:
Variations on Visibility. SCG 1987: 291-299 - [c10]Mark H. Overmars:
New Algorithms for Computer Graphics. Advances in Computer Graphics Hardware 1987: 3-19 - 1985
- [j15]Mark H. Overmars, Emo Welzl:
A simple method for solving 2-dimensional static range searching. Bull. EATCS 25: 31-33 (1985) - [j14]Herbert Edelsbrunner, Mark H. Overmars:
Batched Dynamic Solutions to Decomposable Searching Problems. J. Algorithms 6(4): 515-542 (1985) - [c9]Mark H. Overmars:
Range searching in a set of line segments. SCG 1985: 177-185 - [c8]Mark H. Overmars, Emo Welzl:
The complexity of cutting paper (extended abstract). SCG 1985: 316-321 - [c7]Hans-Peter Kriegel, Rita Mannss, Mark H. Overmars:
The Inverted File Tree Machine: Efficient Multi-Key Retrieval for VLSI. FODO 1985: 279-291 - 1984
- [j13]Herbert Edelsbrunner, Mark H. Overmars, Raimund Seidel:
Some methods of computational geometry applied to computer graphics. Comput. Vis. Graph. Image Process. 28(1): 92-108 (1984) - 1983
- [b1]Mark H. Overmars:
The Design of Dynamic Data Structures. Lecture Notes in Computer Science 156, Springer 1983, ISBN 3-540-12330-X - [j12]Mark H. Overmars:
Corrigendum: Dynamization of Order Decomposable Set Problems. J. Algorithms 4(3): 301 (1983) - [c6]Mark H. Overmars:
The Locus Approach. WG 1983: 263-273 - 1982
- [j11]Mark H. Overmars, Jan van Leeuwen:
Dynamic Multi-Dimensional Data Structures Based on Quad- and K - D Trees. Acta Informatica 17: 267-285 (1982) - [j10]Jan van Leeuwen, Mark H. Overmars:
Stratified Balanced Search Trees. Acta Informatica 18: 345-359 (1982) - [j9]Herbert Edelsbrunner, Mark H. Overmars:
On the Equivalence of Some Rectangle Problems. Inf. Process. Lett. 14(3): 124-127 (1982) - [c5]Mark H. Overmars:
Lowerbounds and Upperbounds on VLSI-Layouts for Perfect Binary Trees. WG 1982: 225-232 - 1981
- [j8]Mark H. Overmars, Jan van Leeuwen:
Two general methods for dynamizing decomposable searching problems. Computing 26(2): 155-166 (1981) - [j7]Mark H. Overmars, Jan van Leeuwen:
Some Principles for Dynamizing Decomposable Searching Problems. Inf. Process. Lett. 12(1): 49-53 (1981) - [j6]Kurt Mehlhorn, Mark H. Overmars:
Optimal Dynamization of Decomposable Searching Problems. Inf. Process. Lett. 12(2): 93-98 (1981) - [j5]Mark H. Overmars:
General Methods for 'All Elements' and 'All Pairs' Problems. Inf. Process. Lett. 12(2): 99-102 (1981) - [j4]Mark H. Overmars, Jan van Leeuwen:
Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems. Inf. Process. Lett. 12(4): 168-173 (1981) - [j3]Mark H. Overmars:
Dynamization of Order Decomposable Set Problems. J. Algorithms 2(3): 245-260 (1981) - [j2]Mark H. Overmars, Jan van Leeuwen:
Maintenance of Configurations in the Plane. J. Comput. Syst. Sci. 23(2): 166-204 (1981) - [c4]Jan van Leeuwen, Mark H. Overmars:
The Art of Dynamizing. MFCS 1981: 121-131 - [c3]Mark H. Overmars, Jan van Leeuwen:
Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds. Theoretical Computer Science 1981: 224-233 - [c2]Mark H. Overmars:
Transforming Semi-Dynamic Data Structures into Dynamic Structures. WG 1981: 173-182 - 1980
- [j1]Mark H. Overmars, Jan van Leeuwen:
Further Comments on Bykat's Convex Hull Algorithm. Inf. Process. Lett. 10(4/5): 209-212 (1980) - [c1]Mark H. Overmars, Jan van Leeuwen:
Dynamically Maintaining Configurations in the Plane (Detailed Abstract). STOC 1980: 135-145
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: