Mark H. Overmars

242 papers A* 25A 15B 13C 13Misc 1Journal 118Unranked 53

Year	Rank	Type	Title / Venue / Authors
2013	—	`book`	Learning C# by Programming Games. Arjan Egges, Jeroen Fokker, Mark H. Overmars
2012	J	`jnl`	On a class of O(n Comput. Geom. Anka Gajentaan, Mark H. Overmars
2012	J	`jnl`	Simulating and Evaluating the Local Behavior of Small Pedestrian Groups. IEEE Trans. Vis. Comput. Graph. Ioannis Karamouzas, Mark H. Overmars
2011	J	`jnl`	Computing Signed Permutations of Polygons. Int. J. Comput. Geom. Appl. Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint
2011	—	`conf`	Interactive Character Animation using Simulated Physics. Eurographics (State of the Art Reports) Thomas Geijtenbeek, Nicolas Pronost, Arjan Egges, Mark H. Overmars
2010	B	`conf`	A Velocity-Based Approach for Simulating Human Collision Avoidance. IVA Ioannis Karamouzas, Mark H. Overmars
2010	J	`jnl`	Real Time Animation of Virtual Humans: A Trade-off Between Naturalness and Control. Comput. Graph. Forum Herwin van Welbergen, Ben J. H. van Basten, Arjan Egges, Zsófia Ruttkay, Mark H. Overmars
2010	—	`conf`	Simulating Human Collision Avoidance Using a Velocity-Based Approach. VRIPHYS Ioannis Karamouzas, Mark H. Overmars
2010	B	`conf`	Simulating the local behaviour of small pedestrian groups. VRST Ioannis Karamouzas, Mark H. Overmars
2009	C	`conf`	A Predictive Collision Avoidance Model for Pedestrian Simulation. MIG Ioannis Karamouzas, Peter Heil, Pascal van Beek, Mark H. Overmars
2009	—	`conf`	Density constraints for crowd simulation. ICE-GIC Ioannis Karamouzas, Jiri Bakker, Mark H. Overmars
2009	J	`jnl`	Guest editors' introduction: Special issue on gaming. Comput. Animat. Virtual Worlds Arjan Egges, Arno Kamphuis, Mark H. Overmars
2009	C	`conf`	Indicative routes for path planning and crowd simulation. FDG Ioannis Karamouzas, Roland Geraerts, Mark H. Overmars
2009	C	`ed.`	Motion in Games, Second International Workshop, MIG 2009, Zeist, The Netherlands, November 21-24, 2009. Proceedings MIG Arjan Egges, Roland Geraerts, Mark H. Overmars
2009	—	`conf`	Real Time Animation of Virtual Humans: A Trade-off Between Naturalness and Control. Eurographics (State of the Art Reports) Herwin van Welbergen, Ben J. H. van Basten, Arjan Egges, Zsófia Ruttkay, Mark H. Overmars
2008	J	`jnl`	Adding variation to path planning. Comput. Animat. Virtual Worlds Ioannis Karamouzas, Mark H. Overmars
2008	—	`book`	Computational geometry: algorithms and applications, 3rd Edition. Mark de Berg, Otfried Cheong, Marc J. van Kreveld, Mark H. Overmars
2008	A	`conf`	Flexible Path Planning Using Corridor Maps. ESA Mark H. Overmars, Ioannis Karamouzas, Roland Geraerts
2008	C	`ed.`	Motion in Games, First International Workshop, MIG 2008, Utrecht, The Netherlands, June 14-17, 2008. Revised Papers MIG Arjan Egges, Arno Kamphuis, Mark H. Overmars
2008	J	`jnl`	Planning Time-Minimal Safe Paths Amidst Unpredictably Moving Obstacles. Int. J. Robotics Res. Jur P. van den Berg, Mark H. Overmars
2008	J	`jnl`	Realizing partitions respecting full and partial order information. J. Discrete Algorithms Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin, Mark H. Overmars, Sue Whitesides
2008	C	`conf`	Using the Corridor Map Method for Path Planning for a Large Number of Characters. MIG Roland Geraerts, Arno Kamphuis, Ioannis Karamouzas, Mark H. Overmars
2007	J	`jnl`	An intersection-sensitive algorithm for snap rounding. Comput. Geom. Mark de Berg, Dan Halperin, Mark H. Overmars
2007	J	`jnl`	Creating High-quality Paths for Motion Planning. Int. J. Robotics Res. Roland Geraerts, Mark H. Overmars
2007	A	`conf`	Efficient path planning in changing environments. IROS Dennis Nieuwenhuisen, Jur P. van den Berg, Mark H. Overmars
2007	J	`jnl`	High quality navigation in computer games. Sci. Comput. Program. Dennis Nieuwenhuisen, Arno Kamphuis, Mark H. Overmars
2007	J	`jnl`	Immobilizing Hinged Polygons. Int. J. Comput. Geom. Appl. Jae-Sook Cheong, A. Frank van der Stappen, Kenneth Y. Goldberg, Mark H. Overmars, Elon Rimon
2007	A	`conf`	Kinodynamic motion planning on roadmaps in dynamic environments. IROS Jur P. van den Berg, Mark H. Overmars
2007	J	`jnl`	Pushing a Disk Using Compliance. IEEE Trans. Robotics Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars
2007	J	`jnl`	Reachability-based analysis for Probabilistic Roadmap planners. Robotics Auton. Syst. Roland Geraerts, Mark H. Overmars
2007	A*	`conf`	The Corridor Map Method: Real-Time High-Quality Path Planning. ICRA Roland Geraerts, Mark H. Overmars
2007	J	`jnl`	The corridor map method: a general framework for real-time high-quality path planning. Comput. Animat. Virtual Worlds Roland Geraerts, Mark H. Overmars
2006	C	`conf`	An Effective Framework for Path Planning Amidst Movable Obstacles. WAFR Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars
2006	J	`jnl`	Computing Maximally Separated Sets in the Plane. SIAM J. Comput. Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir
2006	—	`conf`	Computing Shortest Safe Path amidst Growing Discs in the Plane. Robot Navigation Jur P. van den Berg, Mark H. Overmars
2006	A	`conf`	Creating High-quality Roadmaps for Motion Planning in Virtual Environments. IROS Roland Geraerts, Mark H. Overmars
2006	C	`conf`	Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles. WAFR Jur P. van den Berg, Mark H. Overmars
2006	A*	`conf`	Pushing using Compliance. ICRA Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars
2006	J	`jnl`	Sampling and node adding in probabilistic roadmap planners. Robotics Auton. Syst. Roland Geraerts, Mark H. Overmars
2006	B	`conf`	Scientific challenges ingame technology. VRST Mark H. Overmars
2006	—	`book`	The game maker's apprentice - game development for beginners. Jacob Habgood, Mark H. Overmars
2005	C	`ed.`	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 WAFR Michael A. Erdmann, Mark H. Overmars, David Hsu, A. Frank van der Stappen
2005	A	`conf`	Creating robust roadmaps for motion planning in changing environments. IROS Jur P. van den Berg, Dennis Nieuwenhuisen, Leonard Jaillet, Mark H. Overmars
2005	J	`jnl`	Editorial: Special Issue on WAFR 2004. Int. J. Robotics Res. Michael A. Erdmann, David Hsu, Mark H. Overmars, A. Frank van der Stappen
2005	A	`conf`	On improving the clearance for robots in high-dimensional configuration spaces. IROS Roland Geraerts, Mark H. Overmars
2005	A	`conf`	Path planning for pushing a disk using compliance. IROS Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars
2005	A	`conf`	Prioritized motion planning for multiple robots. IROS Jur P. van den Berg, Mark H. Overmars
2005	A*	`conf`	Reachability Analysis of Sampling Based Planners. ICRA Roland Geraerts, Mark H. Overmars
2005	J	`jnl`	Roadmap-based motion planning in dynamic environments. IEEE Trans. Robotics Jur P. van den Berg, Mark H. Overmars
2005	J	`jnl`	Separating Point Sets in Polygonal Environments. Int. J. Comput. Geom. Appl. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
2005	J	`jnl`	TSP with neighborhoods of varying size. J. Algorithms Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen
2005	J	`jnl`	Using Workspace Information as a Guide to Non-uniform Sampling in Probabilistic Roadmap Planners. Int. J. Robotics Res. Jur P. van den Berg, Mark H. Overmars
2004	C	`conf`	Automatic Generation of Camera Motion to Track a Moving Guide. WAFR Onno C. Goemans, Mark H. Overmars
2004	A*	`conf`	Clearance based Path Optimization for Motion Planning. ICRA Roland Geraerts, Mark H. Overmars
2004	A*	`conf`	Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks. SODA Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir
2004	—	`conf`	Finding paths for coherent groups using clearance. Symposium on Computer Animation Arno Kamphuis, Mark H. Overmars
2004	A*	`conf`	Motion Planning for Camera Movements. ICRA Dennis Nieuwenhuisen, Mark H. Overmars
2004	A*	`conf`	Motion Planning for Coherent Groups of Entities. ICRA Arno Kamphuis, Mark H. Overmars
2004	A	`conf`	Roadmap-based motion planning in dynamic environments. IROS Jur P. van den Berg, Mark H. Overmars
2004	—	`conf`	Separating point sets in polygonal environments. SCG Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
2004	J	`jnl`	Teaching Computer Science through Game Design. Computer Mark H. Overmars
2004	A*	`conf`	Useful Cycles in Probabilistic Roadmap Graphs. ICRA Dennis Nieuwenhuisen, Mark H. Overmars
2004	A*	`conf`	Using Workspace Information as a Guide to Non-uniform Sampling in Probabilistic Roadmap Planners. ICRA Jur P. van den Berg, Mark H. Overmars
2003	J	`jnl`	Finding Sets of Points without Empty Convex 6-Gons. Discret. Comput. Geom. Mark H. Overmars
2003	J	`jnl`	Guarding scenes against invasive hypercubes. Comput. Geom. Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
2003	J	`jnl`	On R-trees with low query complexity. Comput. Geom. Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars
2003	J	`jnl`	Preprocessing chains for fast dihedral rotations is hard or even impossible. Comput. Geom. Michael A. Soss, Jeff Erickson, Mark H. Overmars
2002	C	`conf`	A Comparative Study of Probabilistic Roadmap Planners. WAFR Roland Geraerts, Mark H. Overmars
2002	C	`conf`	Algorithms for Motion and Navigation in Virtual Environments and Games. WAFR Mark H. Overmars
2002	—	`conf`	Computing signed permutations of polygons. CCCG Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint
2002	A*	`conf`	Fixturing Hinged Polygons. ICRA Jae-Sook Cheong, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen
2002	B	`conf`	Flat-State Connectivity of Linkages under Dihedral Motions. ISAAC 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
2002	J	`jnl`	Flipturning Polygons. Discret. Comput. Geom. 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
2002	J	`jnl`	Models and motion planning. Comput. Geom. Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
2002	J	`jnl`	Orienting polyhedral parts by pushing. Comput. Geom. Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen
2002	J	`jnl`	Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible CoRR Michael A. Soss, Jeff Erickson, Mark H. Overmars
2002	Misc	`conf`	Recent Developments in Motion Planning. International Conference on Computational Science (3) Mark H. Overmars
2002	J	`jnl`	Reporting intersecting pairs of convex polytopes in two and three dimensions. Comput. Geom. Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold
2002	A*	`conf`	Sensorless Orientation of 3D Polyhedral Parts. ICRA Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen
2002	A	`conf`	TSP with Neighborhoods of Varying Size. ESA Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen
2001	J	`jnl`	Locked and Unlocked Polygonal Chains in Three Dimensions. Discret. Comput. Geom. 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
2001	A*	`conf`	Motion Planning in Environments with Dangerzones. ICRA Danielle Sent, Mark H. Overmars
2001	A*	`conf`	Orienting Parts by Inside-out Pulling. ICRA Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen
2001	J	`jnl`	Pin design for part feeding. Robotica Mike Tao Zhang, Kenneth Y. Goldberg, Gordon Smith, Robert-Paul Berretty, Mark H. Overmars
2001	J	`jnl`	Reconfiguring convex polygons. Comput. Geom. Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
2001	B	`conf`	Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. WADS Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold
2001	J	`jnl`	Trap Design for Vibratory Bowl Feeders. Int. J. Robotics Res. Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen
2000	—	`conf`	A New Visibility Partition for Affine Pattern Matching. DGCI Michiel Hagedoorn, Mark H. Overmars, Remco C. Veltkamp
2000	C	`conf`	A Robust Affine Invariant Similarity Measure Based on Visibility. EuroCG Michiel Hagedoorn, Mark H. Overmars, Remco C. Veltkamp
2000	J	`jnl`	Computing Immobilizing Grasps of Polygonal Parts. Int. J. Robotics Res. A. Frank van der Stappen, Chantal Wentink, Mark H. Overmars
2000	J	`jnl`	Flipturning polygons CoRR 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
2000	—	`conf`	Geometry and Part Feeding. Sensor Based Intelligent Robots A. Frank van der Stappen, Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars
2000	A	`conf`	On R-trees with Low Stabbing Number. ESA Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars
2000	C	`conf`	Orienting Polyhedral Parts by Pushing. EuroCG Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen
2000	—	`conf`	Reconfiguring Convex Polygons. CCCG Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
2000	A*	`conf`	The Toppling Graph: Designing Pin Sequences for Part Feeding. ICRA Mike Tao Zhang, Gordon Smith, Robert-Paul Berretty, Mark H. Overmars, Kenneth Y. Goldberg
1999	A*	`conf`	Computing Form-Closure Configurations. ICRA A. Frank van der Stappen, Chantal Wentink, Mark H. Overmars
1999	—	`conf`	Geometric Algorithms for Trap Design. SCG Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen
1999	J	`jnl`	Locked and Unlocked Polygonal Chains in 3D CoRR 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
1999	A*	`conf`	Locked and Unlocked Polygonal Chains in 3D. SODA 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
1999	A*	`conf`	The Gaussian Sampling Strategy for Probabilistic Roadmap Planners. ICRA Valérie Boor, Mark H. Overmars, A. Frank van der Stappen
1999	A*	`conf`	Trap Design for Vibratory Bowl Feeders. ICRA Robert-Paul Berretty, Kenneth Y. Goldberg, Lawrence Cheung, Mark H. Overmars, Gordon Smith, A. Frank van der Stappen
1998	J	`jnl`	Approximating Voronoi Diagrams of Convex Sites in any Dimension. Int. J. Comput. Geom. Appl. Jules Vleugels, Mark H. Overmars
1998	J	`jnl`	Computing fence designs for orienting parts. Comput. Geom. Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen
1998	J	`jnl`	Computing the Angularity Tolerance. Int. J. Comput. Geom. Appl. Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong
1998	J	`jnl`	Coordinated path planning for multiple robots. Robotics Auton. Syst. Petr Svestka, Mark H. Overmars
1998	J	`jnl`	Dynamic motion planning in low obstacle density environments. Comput. Geom. Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen
1998	A*	`conf`	Geometric Algorithms for Robotic Manipulation. ICALP Mark H. Overmars
1998	—	`conf`	Guarding Scenes against Invasive Hypercubes. WAE Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
1998	J	`jnl`	Interference-free NC machining using spatial planning and Minkowski operations. Comput. Aided Des. Johan W. H. Tangelder, Joris S. M. Vergeest, Mark H. Overmars
1998	J	`jnl`	Locked and Unlocked Polygonal Chains in 3D CoRR 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
1998	—	`conf`	Models and Motion Planning. SWAT Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
1998	J	`jnl`	Motion Planning in Environments with Low Obstacle Density. Discret. Comput. Geom. A. Frank van der Stappen, Mark H. Overmars, Mark de Berg, Jules Vleugels
1998	J	`jnl`	Multilevel Path Planning for Nonholonomic Robots Using Semiholonomic Subsystems. Int. J. Robotics Res. Sepanta Sekhavat, Petr Svestka, Jean-Paul Laumond, Mark H. Overmars
1998	J	`jnl`	Spheres, molecules, and hidden surface removal. Comput. Geom. Dan Halperin, Mark H. Overmars
1998	—	`conf`	Unfolding some classes of orthogonal polyhedra. CCCG Therese Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Mark H. Overmars, Joseph O'Rourke, Steve Robbins, Sue Whitesides
1997	B	`conf`	Dynamic Motion Planning in Low Obstacle Density Environments. WADS Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen
1997	J	`jnl`	Feasibility of Design in Stereolithography. Algorithmica Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu
1997	J	`jnl`	Improved Bounds for Electing a Leader in a Synchronous Ring. Algorithmica Mark H. Overmars, Nicola Santoro
1997	J	`jnl`	Motion Planning for Carlike Robots Using a Probabilistic Learning Approach. Int. J. Robotics Res. Petr Svestka, Mark H. Overmars
1997	J	`jnl`	Motion Planning with Complete Knowledge Using a Colored Som. Int. J. Neural Syst. Jules Vleugels, Joost N. Kok, Mark H. Overmars
1997	J	`jnl`	New Results on Binary Space Partitions in the Plane. Comput. Geom. Mark de Berg, Marko de Groot, Mark H. Overmars
1997	—	`conf`	On Fence Design and the Complexity of Push Plans for Orienting Parts. SCG Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen
1997	J	`jnl`	Perfect Binary Space Partitions. Comput. Geom. Mark de Berg, Marko de Groot, Mark H. Overmars
1997	J	`jnl`	Simple Traversal of a Subdivision Without Extra Storage. Int. J. Geogr. Inf. Sci. Mark de Berg, Marc J. van Kreveld, René van Oostrum, Mark H. Overmars
1997	J	`jnl`	Sparse Arrangements and the Number of Views of Polyhedral Scenes. Int. J. Comput. Geom. Appl. Mark de Berg, Dan Halperin, Mark H. Overmars, Marc J. van Kreveld
1997	J	`jnl`	The Floodlight Problem. Int. J. Comput. Geom. Appl. Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia
1996	—	`conf`	Computing the Angularity Tolerance. CCCG Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong
1996	—	`conf`	Designing the Computational Geometry Algorithms Library CGAL. WACG Mark H. Overmars
1996	—	`conf`	Fixture Design with Edge-Fixels. Intelligent Robots Chantal Wentink, A. Frank van der Stappen, Mark H. Overmars
1996	J	`jnl`	Hunting Voronoi Vertices. Comput. Geom. Jules Vleugels, Vincenzo Ferrucci, Mark H. Overmars, Anil S. Rao
1996	B	`conf`	Probabilistic Approaches to Motion Planning. SOFSEM Mark H. Overmars, Petr Svestka
1996	J	`jnl`	Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robotics Autom. Lydia E. Kavraki, Petr Svestka, Jean-Claude Latombe, Mark H. Overmars
1996	J	`jnl`	Range Searching and Point Location among Fat Objects. J. Algorithms Mark H. Overmars, A. Frank van der Stappen
1996	—	`conf`	Simple Traversal of a Subdivision Without Extra Storage. SCG Mark de Berg, René van Oostrum, Mark H. Overmars
1996	—	`conf`	The Complexity of Rivers in Triangulated Terrains. CCCG Mark de Berg, Prosenjit Bose, Katrin Dobrindt, Marc J. van Kreveld, Mark H. Overmars, Marko de Groot, Thomas Roos, Jack Snoeyink, Sidi Yu
1996	J	`jnl`	The Exact Fitting Problem in Higher Dimensions. Comput. Geom. Leonidas J. Guibas, Mark H. Overmars, Jean-Marc Robert
1995	A*	`conf`	Coordinated Motion Planning for Multiple Car-Like Robots Using Probabilistic Roadmaps. ICRA Petr Svestka, Mark H. Overmars
1995	—	`conf`	Immobilizing Polygons against a Wall. SCG Mark H. Overmars, Anil S. Rao, Otfried Schwarzkopf, Chantal Wentink
1995	J	`jnl`	On a Class of O(n2) Problems in Computational Geometry. Comput. Geom. Anka Gajentaan, Mark H. Overmars
1995	—	`conf`	Printed Circuit Board Simplification: Simplifying Subdivisions in Practice. SCG Berto van de Kraats, Marc J. van Kreveld, Mark H. Overmars
1995	J	`jnl`	Reaching a Goal with Directional Uncertainty. Theor. Comput. Sci. Mark de Berg, Leonidas J. Guibas, Dan Halperin, Mark H. Overmars, Otfried Schwarzkopf, Micha Sharir, Monique Teillaud
1995	—	`conf`	Simple Traversal of a Subdivision Without Extra Storage. ACM-GIS Mark de Berg, Marc J. van Kreveld, René van Oostrum, Mark H. Overmars
1994	J	`jnl`	An Improved Technique for Output-Sensitive Hidden Surface Removal. Algorithmica Mark H. Overmars, Micha Sharir
1994	J	`jnl`	Computing and Verifying Depth Orders. SIAM J. Comput. Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf
1994	J	`jnl`	Concatenable Structures for Decomposable Problems Inf. Comput. Marc J. van Kreveld, Mark H. Overmars
1994	J	`jnl`	Efficient Ray Shooting and Hidden Surface Removal. Algorithmica Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld
1994	—	`conf`	Hunting Voronoi Vertices in Non-Polygonal Domains. CCCG Vincenzo Ferrucci, Mark H. Overmars, Anil S. Rao, Jules Vleugels
1994	J	`jnl`	Minimum-link C-oriented paths: Single-source queries. Int. J. Comput. Geom. Appl. John Adegeest, Mark H. Overmars, Jack Snoeyink
1994	—	`conf`	Motion Planning Amidst Fat Obstacles (Extended Abstract). SCG A. Frank van der Stappen, Mark H. Overmars
1994	—	`conf`	New Results on Binary Space Partitions in the Plane (Extended Abstract). SWAT Mark de Berg, Marko de Groot, Mark H. Overmars
1994	A	`conf`	Range Searching and Point Location among Fat Objects. ESA Mark H. Overmars, A. Frank van der Stappen
1994	—	`conf`	Spheres, Molecules, and Hidden Surface Removal. SCG Dan Halperin, Mark H. Overmars
1993	—	`conf`	Efficient Algorithms for Exact Motion Planning Amidst Fat Obstacles. ICRA (1) A. Frank van der Stappen, Dan Halperin, Mark H. Overmars
1993	—	`conf`	Feasability of Design in Stereolithography. FSTTCS Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu
1993	J	`jnl`	Intersection Queries in Curved Objects. J. Algorithms Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars
1993	J	`jnl`	Maintenance of 2- and 3-edge- connected components of graphs I. Discret. Math. Johannes A. La Poutré, Jan van Leeuwen, Mark H. Overmars
1993	J	`jnl`	Output-Sensitive Methods for Rectilinear Hidden Surface Removal Inf. Comput. Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars
1993	—	`conf`	Perfect Binary Space Partitions. CCCG Mark de Berg, Marko de Groot, Mark H. Overmars
1993	B	`conf`	Reaching a Goal with Directional Uncertainty. ISAAC Mark de Berg, Mark H. Overmars, Leonidas J. Guibas, Otfried Schwarzkopf, Monique Teillaud, Dan Halperin, Micha Sharir
1993	J	`jnl`	The Complexity of the Free Space for a Robot Moving Amidst Fat Obstacles. Comput. Geom. A. Frank van der Stappen, Dan Halperin, Mark H. Overmars
1993	—	`conf`	The Floodlight Problem. CCCG Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia
1993	J	`jnl`	Union-Copy Structures and Dynamic Segment Trees. J. ACM Marc J. van Kreveld, Mark H. Overmars
1992	J	`jnl`	A General Approach to Dominance in the Plane. J. Algorithms Mark de Berg, Svante Carlsson, Mark H. Overmars
1992	J	`jnl`	A Simple Output-Sensitive Algorithm for Hidden Surface Removal. ACM Trans. Graph. Micha Sharir, Mark H. Overmars
1992	—	`conf`	Computing and Verifying Depth Orders. SCG Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf
1992	J	`jnl`	Efficient Hidden Surface Removal for Objects with Small Union Size. Comput. Geom. Matthew J. Katz, Mark H. Overmars, Micha Sharir
1992	J	`jnl`	Efficient Motion Planning for an L-Shaped Object. SIAM J. Comput. Dan Halperin, Mark H. Overmars, Micha Sharir
1992	J	`jnl`	Finding Minimum Area k-gons. Discret. Comput. Geom. David Eppstein, Mark H. Overmars, Günter Rote, Gerhard J. Woeginger
1992	J	`jnl`	Intersection Queries in Sets of Disks. BIT Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal
1992	J	`jnl`	Point Location in Fat Subdivisions. Inf. Process. Lett. Mark H. Overmars
1992	J	`jnl`	Shortest path queries in rectilinear worlds. Int. J. Comput. Geom. Appl. Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars
1991	J	`jnl`	Divided k-d Trees. Algorithmica Marc J. van Kreveld, Mark H. Overmars
1991	J	`jnl`	Dynamic Partition Trees. BIT Haijo Schipper, Mark H. Overmars
1991	—	`conf`	Efficient Hidden Surface Removal for Objects with small Union Size. SCG Matthew J. Katz, Mark H. Overmars, Micha Sharir
1991	—	`conf`	Efficient Ray Shooting and Hidden Surface Removal. SCG Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld
1991	J	`jnl`	Hidden Surface Removal for C-oriented Polyhedra. Comput. Geom. Mark de Berg, Mark H. Overmars
1991	—	`conf`	Intersection Queries for Curved Objects (Extended Abstract). SCG Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars
1991	J	`jnl`	Merging Visibility Maps. Comput. Geom. Mark H. Overmars, Micha Sharir
1991	J	`jnl`	New Upper Bounds in Klee's Measure Problem. SIAM J. Comput. Mark H. Overmars, Chee-Keng Yap
1990	A*	`conf`	An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version). ICALP Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars
1990	—	`conf`	Dynamic Partition Trees. SWAT Haijo Schipper, Mark H. Overmars
1990	—	`conf`	Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric. SWAT Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars
1990	A*	`conf`	Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract) FOCS Mark de Berg, Mark H. Overmars
1990	—	`conf`	Intersection Queries in Sets of Disks. SWAT Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal
1990	J	`jnl`	Maintaining Range Trees in Secondary Memory. Part I: Partitions. Acta Informatica Mark H. Overmars, Michiel H. M. Smid, Mark de Berg, Marc J. van Kreveld
1990	J	`jnl`	Maintaining Range Trees in Secondary Memory. Part II: Lower Bounds. Acta Informatica Michiel H. M. Smid, Mark H. Overmars
1990	—	`conf`	Merging Visibility Maps. SCG Mark H. Overmars, Micha Sharir
1990	J	`jnl`	Ranking intervals under visibility constraints. Int. J. Comput. Math. Herbert Edelsbrunner, Mark H. Overmars, Emo Welzl, Irith Ben-Arroyo Hartman, Jack A. Feldman
1990	J	`jnl`	Searching for Empty Convex Polygons. Algorithmica David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars
1990	J	`jnl`	Storing Line Segments in Partition Trees. BIT Mark H. Overmars, Haijo Schipper, Micha Sharir
1989	—	`conf`	Computational Geometry and its Application to Computer Graphics. Advances in Computer Graphics Mark H. Overmars
1989	A	`conf`	Concatenable Segment Trees (Extended Abstract). STACS Marc J. van Kreveld, Mark H. Overmars
1989	J	`jnl`	Data Structures in a Real-Time Environment. Inf. Process. Lett. Patrick Lentfert, Mark H. Overmars
1989	—	`conf`	Efficient Motion Planning for an L-Shaped Object. SCG Dan Halperin, Mark H. Overmars
1989	J	`jnl`	General Methods for Adding Range Restrictions to Decomposable Searching Problems. J. Symb. Comput. Hans W. Scholten, Mark H. Overmars
1989	J	`jnl`	Maintaining Multiple Representations of Dynamic Data Structures Inf. Comput. Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas
1989	—	`conf`	Multiple Representations of Dynamic Data Structures. IFIP Congress Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas
1989	A*	`conf`	Output-Sensitive Hidden Surface Removal FOCS Mark H. Overmars, Micha Sharir
1989	J	`jnl`	Sets without emtpy convex 6-gons. Bull. EATCS Mark H. Overmars, Bertha Scholten, Ingrid Vincent
1989	A	`conf`	TIME vs BITS. STACS Mark H. Overmars, Nicola Santoro
1989	J	`jnl`	Two Models for the Reconstruction Problem for Dynamic Data Structures. J. Inf. Process. Cybern. Michiel H. M. Smid, Leen Torenvliet, Peter van Emde Boas, Mark H. Overmars
1988	J	`jnl`	A Balanced Search Tree with Acta Informatica Christos Levcopoulos, Mark H. Overmars
1988	—	`conf`	Connectability Problems. SWAT Mark H. Overmars
1988	B	`conf`	Dominance in the Presence of Obstracles. WG Mark de Berg, Mark H. Overmars
1988	J	`jnl`	Efficient Data Structures for Range Searching on a Grid. J. Algorithms Mark H. Overmars
1988	—	`conf`	Intersecting Line Segments, Ray Shooting, and Other Applications of Geometric Partitioning Techniques. SWAT Leonidas J. Guibas, Mark H. Overmars, Micha Sharir
1988	A	`conf`	Maintaining Range Trees in Secondary Memory (Extended Abstract). STACS Mark H. Overmars, Michiel H. M. Smid
1988	—	`conf`	New Methods for Computing Visibility Graphs. SCG Mark H. Overmars, Emo Welzl
1988	A*	`conf`	New upper bounds in Klee's measure problem (extended abstract) FOCS Mark H. Overmars, Chee-Keng Yap
1988	J	`jnl`	Normalized Divide-and-Conquer: A Scaling Technique for Solving Multi-Dimensional Problems. Inf. Process. Lett. Rolf G. Karlsson, Mark H. Overmars
1988	J	`jnl`	On Rectangular Visibility. J. Algorithms Mark H. Overmars, Derick Wood
1988	J	`jnl`	Scanline Algorithms on a Grid. BIT Rolf G. Karlsson, Mark H. Overmars
1988	—	`conf`	Searching for Empty Convex Polygons. SCG David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars
1987	—	`conf`	New Algorithms for Computer Graphics. Advances in Computer Graphics Hardware Mark H. Overmars
1987	—	`conf`	Variations on Visibility. SCG J. Ian Munro, Mark H. Overmars, Derick Wood
1987	J	`jnl`	Zooming by Repeated Range Detection. Inf. Process. Lett. Herbert Edelsbrunner, Mark H. Overmars
1985	J	`jnl`	A simple method for solving 2-dimensional static range searching. Bull. EATCS Mark H. Overmars, Emo Welzl
1985	J	`jnl`	Batched Dynamic Solutions to Decomposable Searching Problems. J. Algorithms Herbert Edelsbrunner, Mark H. Overmars
1985	—	`conf`	Range searching in a set of line segments. SCG Mark H. Overmars
1985	—	`conf`	The Inverted File Tree Machine: Efficient Multi-Key Retrieval for VLSI. FODO Hans-Peter Kriegel, Rita Mannss, Mark H. Overmars
1985	—	`conf`	The complexity of cutting paper (extended abstract). SCG Mark H. Overmars, Emo Welzl
1984	J	`jnl`	Some methods of computational geometry applied to computer graphics. Comput. Vis. Graph. Image Process. Herbert Edelsbrunner, Mark H. Overmars, Raimund Seidel
1983	J	`jnl`	Corrigendum: Dynamization of Order Decomposable Set Problems. J. Algorithms Mark H. Overmars
1983	—	`book`	The Design of Dynamic Data Structures Mark H. Overmars
1983	B	`conf`	The Locus Approach. WG Mark H. Overmars
1982	J	`jnl`	Dynamic Multi-Dimensional Data Structures Based on Quad- and Acta Informatica Mark H. Overmars, Jan van Leeuwen
1982	B	`conf`	Lowerbounds and Upperbounds on VLSI-Layouts for Perfect Binary Trees. WG Mark H. Overmars
1982	J	`jnl`	On the Equivalence of Some Rectangle Problems. Inf. Process. Lett. Herbert Edelsbrunner, Mark H. Overmars
1982	J	`jnl`	Stratified Balanced Search Trees. Acta Informatica Jan van Leeuwen, Mark H. Overmars
1981	—	`conf`	Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds. Theoretical Computer Science Mark H. Overmars, Jan van Leeuwen
1981	J	`jnl`	Dynamization of Order Decomposable Set Problems. J. Algorithms Mark H. Overmars
1981	J	`jnl`	General Methods for 'All Elements' and 'All Pairs' Problems. Inf. Process. Lett. Mark H. Overmars
1981	J	`jnl`	Maintenance of Configurations in the Plane. J. Comput. Syst. Sci. Mark H. Overmars, Jan van Leeuwen
1981	J	`jnl`	Optimal Dynamization of Decomposable Searching Problems. Inf. Process. Lett. Kurt Mehlhorn, Mark H. Overmars
1981	J	`jnl`	Some Principles for Dynamizing Decomposable Searching Problems. Inf. Process. Lett. Mark H. Overmars, Jan van Leeuwen
1981	B	`conf`	The Art of Dynamizing. MFCS Jan van Leeuwen, Mark H. Overmars
1981	B	`conf`	Transforming Semi-Dynamic Data Structures into Dynamic Structures. WG Mark H. Overmars
1981	J	`jnl`	Two general methods for dynamizing decomposable searching problems. Computing Mark H. Overmars, Jan van Leeuwen
1981	J	`jnl`	Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems. Inf. Process. Lett. Mark H. Overmars, Jan van Leeuwen
1980	A*	`conf`	Dynamically Maintaining Configurations in the Plane (Detailed Abstract) STOC Mark H. Overmars, Jan van Leeuwen
1980	J	`jnl`	Further Comments on Bykat's Convex Hull Algorithm. Inf. Process. Lett. Mark H. Overmars, Jan van Leeuwen