Mark H. Overmars

According to our database, Mark H. Overmars authored at least 210 papers between 1980 and 2013.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2013

Learning C# by Programming Games.

Arjan Egges, Jeroen Fokker, Mark H. Overmars

Springer, ISBN: 978-3-642-36579-9, 2013

2012

Simulating and Evaluating the Local Behavior of Small Pedestrian Groups.

Ioannis Karamouzas, Mark H. Overmars

IEEE Trans. Vis. Comput. Graph., 2012

On a class of O(n²) problems in computational geometry.

Anka Gajentaan, Mark H. Overmars

Comput. Geom., 2012

2011

Computing Signed Permutations of Polygons.

Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint

Int. J. Comput. Geom. Appl., 2011

Interactive Character Animation using Simulated Physics.

Thomas Geijtenbeek, Nicolas Pronost, Arjan Egges, Mark H. Overmars

Proceedings of the 32nd Annual Conference of the European Association for Computer Graphics, 2011

2010

Real Time Animation of Virtual Humans: A Trade-off Between Naturalness and Control.

Herwin van Welbergen, Ben J. H. van Basten, Arjan Egges, Zsófia Ruttkay, Mark H. Overmars

Comput. Graph. Forum, 2010

Simulating the local behaviour of small pedestrian groups.

Ioannis Karamouzas, Mark H. Overmars

Proceedings of the ACM Symposium on Virtual Reality Software and Technology, 2010

Simulating Human Collision Avoidance Using a Velocity-Based Approach.

Ioannis Karamouzas, Mark H. Overmars

Proceedings of the Seventh Workshop on Virtual Reality Interactions and Physical Simulations, 2010

A Velocity-Based Approach for Simulating Human Collision Avoidance.

Ioannis Karamouzas, Mark H. Overmars

Proceedings of the Intelligent Virtual Agents, 10th International Conference, 2010

2009

Guest editors' introduction: Special issue on gaming.

Arjan Egges, Arno Kamphuis, Mark H. Overmars

Comput. Animat. Virtual Worlds, 2009

A Predictive Collision Avoidance Model for Pedestrian Simulation.

Ioannis Karamouzas, Peter Heil, Pascal van Beek, Mark H. Overmars

Proceedings of the Motion in Games, Second International Workshop, 2009

Density constraints for crowd simulation.

Ioannis Karamouzas, Jiri Bakker, Mark H. Overmars

Proceedings of the 2009 International IEEE Consumer Electronics Society's Games Innovations Conference, 2009

Indicative routes for path planning and crowd simulation.

Ioannis Karamouzas, Roland Geraerts, Mark H. Overmars

Proceedings of the 4th International Conference on Foundations of Digital Games, 2009

2008

Adding variation to path planning.

Ioannis Karamouzas, Mark H. Overmars

Comput. Animat. Virtual Worlds, 2008

Realizing partitions respecting full and partial order information.

Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin, Mark H. Overmars, Sue Whitesides

J. Discrete Algorithms, 2008

Planning Time-Minimal Safe Paths Amidst Unpredictably Moving Obstacles.

Jur P. van den Berg, Mark H. Overmars

Int. J. Robotics Res., 2008

Using the Corridor Map Method for Path Planning for a Large Number of Characters.

Roland Geraerts, Arno Kamphuis, Ioannis Karamouzas, Mark H. Overmars

Proceedings of the Motion in Games, First International Workshop, 2008

Flexible Path Planning Using Corridor Maps.

Mark H. Overmars, Ioannis Karamouzas, Roland Geraerts

Proceedings of the Algorithms, 2008

Computational geometry: algorithms and applications, 3rd Edition.

Mark de Berg, Otfried Cheong, Marc J. van Kreveld, Mark H. Overmars

Springer, ISBN: 9783540779735, 2008

2007

Pushing a Disk Using Compliance.

Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars

IEEE Trans. Robotics, 2007

High quality navigation in computer games.

Dennis Nieuwenhuisen, Arno Kamphuis, Mark H. Overmars

Sci. Comput. Program., 2007

Reachability-based analysis for Probabilistic Roadmap planners.

Roland Geraerts, Mark H. Overmars

Robotics Auton. Syst., 2007

The corridor map method: a general framework for real-time high-quality path planning.

Roland Geraerts, Mark H. Overmars

Comput. Animat. Virtual Worlds, 2007

Creating High-quality Paths for Motion Planning.

Roland Geraerts, Mark H. Overmars

Int. J. Robotics Res., 2007

Immobilizing Hinged Polygons.

Jae-Sook Cheong, A. Frank van der Stappen, Kenneth Y. Goldberg, Mark H. Overmars, Elon Rimon

Int. J. Comput. Geom. Appl., 2007

An intersection-sensitive algorithm for snap rounding.

Mark de Berg, Dan Halperin, Mark H. Overmars

Comput. Geom., 2007

Efficient path planning in changing environments.

Dennis Nieuwenhuisen, Jur P. van den Berg, Mark H. Overmars

Proceedings of the 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, October 29, 2007

Kinodynamic motion planning on roadmaps in dynamic environments.

Jur P. van den Berg, Mark H. Overmars

Proceedings of the 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, October 29, 2007

The Corridor Map Method: Real-Time High-Quality Path Planning.

Roland Geraerts, Mark H. Overmars

Proceedings of the 2007 IEEE International Conference on Robotics and Automation, 2007

2006

Computing Maximally Separated Sets in the Plane.

Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir

SIAM J. Comput., 2006

Sampling and node adding in probabilistic roadmap planners.

Roland Geraerts, Mark H. Overmars

Robotics Auton. Syst., 2006

An Effective Framework for Path Planning Amidst Movable Obstacles.

Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars

Proceedings of the Algorithmic Foundation of Robotics VII, 2006

Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles.

Jur P. van den Berg, Mark H. Overmars

Proceedings of the Algorithmic Foundation of Robotics VII, 2006

Scientific challenges ingame technology.

Mark H. Overmars

Proceedings of the ACM Symposium on Virtual Reality Software and Technology, 2006

Creating High-quality Roadmaps for Motion Planning in Virtual Environments.

Roland Geraerts, Mark H. Overmars

Proceedings of the 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2006

Pushing using Compliance.

Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars

Proceedings of the 2006 IEEE International Conference on Robotics and Automation, 2006

Computing Shortest Safe Path amidst Growing Discs in the Plane.

Jur P. van den Berg, Mark H. Overmars

Proceedings of the Robot Navigation, 15.10. - 20.10.2006, 2006

The game maker's apprentice - game development for beginners.

Jacob Habgood, Mark H. Overmars

Apress, ISBN: 978-1-59059-615-9, 2006

2005

Roadmap-based motion planning in dynamic environments.

Jur P. van den Berg, Mark H. Overmars

IEEE Trans. Robotics, 2005

TSP with neighborhoods of varying size.

Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen

J. Algorithms, 2005

Editorial: Special Issue on WAFR 2004.

Michael A. Erdmann, David Hsu, Mark H. Overmars, A. Frank van der Stappen

Int. J. Robotics Res., 2005

Using Workspace Information as a Guide to Non-uniform Sampling in Probabilistic Roadmap Planners.

Jur P. van den Berg, Mark H. Overmars

Int. J. Robotics Res., 2005

Separating Point Sets in Polygonal Environments.

Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides

Int. J. Comput. Geom. Appl., 2005

Path planning for pushing a disk using compliance.

Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars

Proceedings of the 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2005

On improving the clearance for robots in high-dimensional configuration spaces.

Roland Geraerts, Mark H. Overmars

Proceedings of the 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2005

Prioritized motion planning for multiple robots.

Jur P. van den Berg, Mark H. Overmars

Proceedings of the 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2005

Creating robust roadmaps for motion planning in changing environments.

Jur P. van den Berg, Dennis Nieuwenhuisen, Leonard Jaillet, Mark H. Overmars

Proceedings of the 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2005

Reachability Analysis of Sampling Based Planners.

Roland Geraerts, Mark H. Overmars

Proceedings of the 2005 IEEE International Conference on Robotics and Automation, 2005

2004

Teaching Computer Science through Game Design.

Mark H. Overmars

Computer, 2004

Automatic Generation of Camera Motion to Track a Moving Guide.

Onno C. Goemans, Mark H. Overmars

Proceedings of the Algorithmic Foundations of Robotics VI, 2004

Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks.

Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Finding paths for coherent groups using clearance.

Arno Kamphuis, Mark H. Overmars

Proceedings of the 2004 ACM SIGGRAPH/Eurographics Symposium on Computer Animation, 2004

Motion Planning for Camera Movements.

Dennis Nieuwenhuisen, Mark H. Overmars

Proceedings of the 2004 IEEE International Conference on Robotics and Automation, 2004

Useful Cycles in Probabilistic Roadmap Graphs.

Dennis Nieuwenhuisen, Mark H. Overmars

Proceedings of the 2004 IEEE International Conference on Robotics and Automation, 2004

Motion Planning for Coherent Groups of Entities.

Arno Kamphuis, Mark H. Overmars

Proceedings of the 2004 IEEE International Conference on Robotics and Automation, 2004

Clearance based Path Optimization for Motion Planning.

Roland Geraerts, Mark H. Overmars

Proceedings of the 2004 IEEE International Conference on Robotics and Automation, 2004

2003

Finding Sets of Points without Empty Convex 6-Gons.

Mark H. Overmars

Discret. Comput. Geom., 2003

Preprocessing chains for fast dihedral rotations is hard or even impossible.

Michael A. Soss, Jeff Erickson, Mark H. Overmars

Comput. Geom., 2003

On R-trees with low query complexity.

Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars

Comput. Geom., 2003

Guarding scenes against invasive hypercubes.

Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels

Comput. Geom., 2003

2002

Flipturning Polygons.

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

Discret. Comput. Geom., 2002

Orienting polyhedral parts by pushing.

Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen

Comput. Geom., 2002

Models and motion planning.

Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels

Comput. Geom., 2002

Reporting intersecting pairs of convex polytopes in two and three dimensions.

Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold

Comput. Geom., 2002

Algorithms for Motion and Navigation in Virtual Environments and Games.

Mark H. Overmars

Proceedings of the Algorithmic Foundations of Robotics V, 2002

A Comparative Study of Probabilistic Roadmap Planners.

Roland Geraerts, Mark H. Overmars

Proceedings of the Algorithmic Foundations of Robotics V, 2002

Flat-State Connectivity of Linkages under Dihedral Motions.

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

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Fixturing Hinged Polygons.

Jae-Sook Cheong, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen

Proceedings of the 2002 IEEE International Conference on Robotics and Automation, 2002

Sensorless Orientation of 3D Polyhedral Parts.

Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen

Proceedings of the 2002 IEEE International Conference on Robotics and Automation, 2002

Recent Developments in Motion Planning.

Mark H. Overmars

Proceedings of the Computational Science - ICCS 2002, 2002

2001

Pin design for part feeding.

Mike Tao Zhang, Kenneth Y. Goldberg, Gordon Smith, Robert-Paul Berretty, Mark H. Overmars

Robotica, 2001

Trap Design for Vibratory Bowl Feeders.

Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen

Int. J. Robotics Res., 2001

Locked and Unlocked Polygonal Chains in Three Dimensions.

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

Discret. Comput. Geom., 2001

Reconfiguring convex polygons.

Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint

Comput. Geom., 2001

Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions.

Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Motion Planning in Environments with Dangerzones.

Danielle Sent, Mark H. Overmars

Proceedings of the 2001 IEEE International Conference on Robotics and Automation, 2001

Orienting Parts by Inside-out Pulling.

Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen

Proceedings of the 2001 IEEE International Conference on Robotics and Automation, 2001

2000

Computing Immobilizing Grasps of Polygonal Parts.

A. Frank van der Stappen, Chantal Wentink, Mark H. Overmars

Int. J. Robotics Res., 2000

The Toppling Graph: Designing Pin Sequences for Part Feeding.

Mike Tao Zhang, Gordon Smith, Robert-Paul Berretty, Mark H. Overmars, Kenneth Y. Goldberg

Proceedings of the 2000 IEEE International Conference on Robotics and Automation, 2000

A Robust Affine Invariant Similarity Measure Based on Visibility.

Michiel Hagedoorn, Mark H. Overmars, Remco C. Veltkamp

EuroCG, 2000

On R-trees with Low Stabbing Number.

Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars

Proceedings of the Algorithms, 2000

A New Visibility Partition for Affine Pattern Matching.

Michiel Hagedoorn, Mark H. Overmars, Remco C. Veltkamp

Proceedings of the Discrete Geometry for Computer Imagery, 9th International Conference, 2000

Geometry and Part Feeding.

A. Frank van der Stappen, Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars

Proceedings of the Sensor Based Intelligent Robots, 2000

1999

Locked and Unlocked Polygonal Chains in 3D.

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

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Computing Form-Closure Configurations.

A. Frank van der Stappen, Chantal Wentink, Mark H. Overmars

Proceedings of the 1999 IEEE International Conference on Robotics and Automation, 1999

The Gaussian Sampling Strategy for Probabilistic Roadmap Planners.

Valérie Boor, Mark H. Overmars, A. Frank van der Stappen

Proceedings of the 1999 IEEE International Conference on Robotics and Automation, 1999

Trap Design for Vibratory Bowl Feeders.

Robert-Paul Berretty, Kenneth Y. Goldberg, Lawrence Cheung, Mark H. Overmars, Gordon Smith, A. Frank van der Stappen

Proceedings of the 1999 IEEE International Conference on Robotics and Automation, 1999

Geometric Algorithms for Trap Design.

Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998

Coordinated path planning for multiple robots.

Petr Svestka, Mark H. Overmars

Robotics Auton. Syst., 1998

Multilevel Path Planning for Nonholonomic Robots Using Semiholonomic Subsystems.

Sepanta Sekhavat, Petr Svestka, Jean-Paul Laumond, Mark H. Overmars

Int. J. Robotics Res., 1998

Approximating Voronoi Diagrams of Convex Sites in any Dimension.

Jules Vleugels, Mark H. Overmars

Int. J. Comput. Geom. Appl., 1998

Computing the Angularity Tolerance.

Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong

Int. J. Comput. Geom. Appl., 1998

Motion Planning in Environments with Low Obstacle Density.

A. Frank van der Stappen, Mark H. Overmars, Mark de Berg, Jules Vleugels

Discret. Comput. Geom., 1998

Spheres, molecules, and hidden surface removal.

Dan Halperin, Mark H. Overmars

Comput. Geom., 1998

Dynamic motion planning in low obstacle density environments.

Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen

Comput. Geom., 1998

Computing fence designs for orienting parts.

Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen

Comput. Geom., 1998

Interference-free NC machining using spatial planning and Minkowski operations.

Johan W. H. Tangelder, Joris S. M. Vergeest, Mark H. Overmars

Comput. Aided Des., 1998

Geometric Algorithms for Robotic Manipulation.

Mark H. Overmars

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Unfolding some classes of orthogonal polyhedra.

Therese Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Mark H. Overmars, Joseph O'Rourke, Steve Robbins, Sue Whitesides

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997

Motion Planning for Carlike Robots Using a Probabilistic Learning Approach.

Petr Svestka, Mark H. Overmars

Int. J. Robotics Res., 1997

Motion Planning with Complete Knowledge Using a Colored Som.

Jules Vleugels, Joost N. Kok, Mark H. Overmars

Int. J. Neural Syst., 1997

The Floodlight Problem.

Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia

Int. J. Comput. Geom. Appl., 1997

Sparse Arrangements and the Number of Views of Polyhedral Scenes.

Mark de Berg, Dan Halperin, Mark H. Overmars, Marc J. van Kreveld

Int. J. Comput. Geom. Appl., 1997

Simple Traversal of a Subdivision Without Extra Storage.

Mark de Berg, Marc J. van Kreveld, René van Oostrum, Mark H. Overmars

Int. J. Geogr. Inf. Sci., 1997

Perfect Binary Space Partitions.

Mark de Berg, Marko de Groot, Mark H. Overmars

Comput. Geom., 1997

New Results on Binary Space Partitions in the Plane.

Mark de Berg, Marko de Groot, Mark H. Overmars

Comput. Geom., 1997

Improved Bounds for Electing a Leader in a Synchronous Ring.

Mark H. Overmars, Nicola Santoro

Algorithmica, 1997

Feasibility of Design in Stereolithography.

Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu

Algorithmica, 1997

On Fence Design and the Complexity of Push Plans for Orienting Parts.

Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Probabilistic roadmaps for path planning in high-dimensional configuration spaces.

Lydia E. Kavraki, Petr Svestka, Jean-Claude Latombe, Mark H. Overmars

IEEE Trans. Robotics Autom., 1996

Range Searching and Point Location among Fat Objects.

Mark H. Overmars, A. Frank van der Stappen

J. Algorithms, 1996

Hunting Voronoi Vertices.

Jules Vleugels, Vincenzo Ferrucci, Mark H. Overmars, Anil S. Rao

Comput. Geom., 1996

The Exact Fitting Problem in Higher Dimensions.

Leonidas J. Guibas, Mark H. Overmars, Jean-Marc Robert

Comput. Geom., 1996

Designing the Computational Geometry Algorithms Library CGAL.

Mark H. Overmars

Proceedings of the Applied Computational Geormetry, 1996

Probabilistic Approaches to Motion Planning.

Mark H. Overmars, Petr Svestka

Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

Fixture Design with Edge-Fixels.

Chantal Wentink, A. Frank van der Stappen, Mark H. Overmars

Proceedings of the Intelligent Robots: Sensing, 1996

Simple Traversal of a Subdivision Without Extra Storage.

Mark de Berg, René van Oostrum, Mark H. Overmars

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

The Complexity of Rivers in Triangulated Terrains.

Mark de Berg, Prosenjit Bose, Katrin Dobrindt, Marc J. van Kreveld, Mark H. Overmars, Marko de Groot, Thomas Roos, Jack Snoeyink, Sidi Yu

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995

Reaching a Goal with Directional Uncertainty.

Mark de Berg, Leonidas J. Guibas, Dan Halperin, Mark H. Overmars, Otfried Schwarzkopf, Micha Sharir, Monique Teillaud

Theor. Comput. Sci., 1995

On a Class of O(n2) Problems in Computational Geometry.

Anka Gajentaan, Mark H. Overmars

Comput. Geom., 1995

Coordinated Motion Planning for Multiple Car-Like Robots Using Probabilistic Roadmaps.

Petr Svestka, Mark H. Overmars

Proceedings of the 1995 International Conference on Robotics and Automation, 1995

Immobilizing Polygons against a Wall.

Mark H. Overmars, Anil S. Rao, Otfried Schwarzkopf, Chantal Wentink

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

Printed Circuit Board Simplification: Simplifying Subdivisions in Practice.

Berto van de Kraats, Marc J. van Kreveld, Mark H. Overmars

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

Concatenable Structures for Decomposable Problems

Marc J. van Kreveld, Mark H. Overmars

Inf. Comput., April, 1994

Computing and Verifying Depth Orders.

Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf

SIAM J. Comput., 1994

Minimum-link C-oriented paths: Single-source queries.

John Adegeest, Mark H. Overmars, Jack Snoeyink

Int. J. Comput. Geom. Appl., 1994

An Improved Technique for Output-Sensitive Hidden Surface Removal.

Mark H. Overmars, Micha Sharir

Algorithmica, 1994

Efficient Ray Shooting and Hidden Surface Removal.

Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld

Algorithmica, 1994

New Results on Binary Space Partitions in the Plane (Extended Abstract).

Mark de Berg, Marko de Groot, Mark H. Overmars

Proceedings of the Algorithm Theory, 1994

Motion Planning Amidst Fat Obstacles (Extended Abstract).

A. Frank van der Stappen, Mark H. Overmars

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Hunting Voronoi Vertices in Non-Polygonal Domains.

Vincenzo Ferrucci, Mark H. Overmars, Anil S. Rao, Jules Vleugels

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

Output-Sensitive Methods for Rectilinear Hidden Surface Removal

Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars

Inf. Comput., November, 1993

Intersection Queries in Curved Objects.

Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars

J. Algorithms, 1993

Union-Copy Structures and Dynamic Segment Trees.

Marc J. van Kreveld, Mark H. Overmars

J. ACM, 1993

Maintenance of 2- and 3-edge- connected components of graphs I.

Johannes A. La Poutré, Jan van Leeuwen, Mark H. Overmars

Discret. Math., 1993

The Complexity of the Free Space for a Robot Moving Amidst Fat Obstacles.

A. Frank van der Stappen, Dan Halperin, Mark H. Overmars

Comput. Geom., 1993

Efficient Algorithms for Exact Motion Planning Amidst Fat Obstacles.

A. Frank van der Stappen, Dan Halperin, Mark H. Overmars

Proceedings of the 1993 IEEE International Conference on Robotics and Automation, 1993

Feasability of Design in Stereolithography.

Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

1992

A Simple Output-Sensitive Algorithm for Hidden Surface Removal.

Micha Sharir, Mark H. Overmars

ACM Trans. Graph., 1992

Efficient Motion Planning for an L-Shaped Object.

Dan Halperin, Mark H. Overmars, Micha Sharir

SIAM J. Comput., 1992

A General Approach to Dominance in the Plane.

Mark de Berg, Svante Carlsson, Mark H. Overmars

J. Algorithms, 1992

Point Location in Fat Subdivisions.

Mark H. Overmars

Inf. Process. Lett., 1992

Shortest path queries in rectilinear worlds.

Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars

Int. J. Comput. Geom. Appl., 1992

Finding Minimum Area k-gons.

David Eppstein, Mark H. Overmars, Günter Rote, Gerhard J. Woeginger

Discret. Comput. Geom., 1992

Efficient Hidden Surface Removal for Objects with Small Union Size.

Matthew J. Katz, Mark H. Overmars, Micha Sharir

Comput. Geom., 1992

Intersection Queries in Sets of Disks.

Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal

BIT, 1992

1991

New Upper Bounds in Klee's Measure Problem.

Mark H. Overmars, Chee-Keng Yap

SIAM J. Comput., 1991

Merging Visibility Maps.

Mark H. Overmars, Micha Sharir

Comput. Geom., 1991

Hidden Surface Removal for C-oriented Polyhedra.

Mark de Berg, Mark H. Overmars

Comput. Geom., 1991

Dynamic Partition Trees.

Haijo Schipper, Mark H. Overmars

BIT, 1991

Divided k-d Trees.

Marc J. van Kreveld, Mark H. Overmars

Algorithmica, 1991

Intersection Queries for Curved Objects (Extended Abstract).

Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

Ranking intervals under visibility constraints.

Herbert Edelsbrunner, Mark H. Overmars, Emo Welzl, Irith Ben-Arroyo Hartman, Jack A. Feldman

Int. J. Comput. Math., 1990

Storing Line Segments in Partition Trees.

Mark H. Overmars, Haijo Schipper, Micha Sharir

BIT, 1990

Searching for Empty Convex Polygons.

David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars

Algorithmica, 1990

Maintaining Range Trees in Secondary Memory. Part II: Lower Bounds.

Michiel H. M. Smid, Mark H. Overmars

Acta Informatica, 1990

Maintaining Range Trees in Secondary Memory. Part I: Partitions.

Mark H. Overmars, Michiel H. M. Smid, Mark de Berg, Marc J. van Kreveld

Acta Informatica, 1990

Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric.

Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars

Proceedings of the SWAT 90, 1990

An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version).

Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract)

Mark de Berg, Mark H. Overmars

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

Maintaining Multiple Representations of Dynamic Data Structures

Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas

Inf. Comput., November, 1989

General Methods for Adding Range Restrictions to Decomposable Searching Problems.

Hans W. Scholten, Mark H. Overmars

J. Symb. Comput., 1989

Data Structures in a Real-Time Environment.

Patrick Lentfert, Mark H. Overmars

Inf. Process. Lett., 1989

Two Models for the Reconstruction Problem for Dynamic Data Structures.

Michiel H. M. Smid, Leen Torenvliet, Peter van Emde Boas, Mark H. Overmars

J. Inf. Process. Cybern., 1989

Sets without emtpy convex 6-gons.

Mark H. Overmars, Bertha Scholten, Ingrid Vincent

Bull. EATCS, 1989

TIME vs BITS.

Mark H. Overmars, Nicola Santoro

Proceedings of the STACS 89, 1989

Concatenable Segment Trees (Extended Abstract).

Marc J. van Kreveld, Mark H. Overmars

Proceedings of the STACS 89, 1989

Multiple Representations of Dynamic Data Structures.

Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas

Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

Output-Sensitive Hidden Surface Removal

Mark H. Overmars, Micha Sharir

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Computational Geometry and its Application to Computer Graphics.

Mark H. Overmars

Proceedings of the Advances in Computer Graphics V (Tutorials from Eurographics'89 Conf.), 1989

Efficient Motion Planning for an L-Shaped Object.

Dan Halperin, Mark H. Overmars

Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988

On Rectangular Visibility.

Mark H. Overmars, Derick Wood

J. Algorithms, 1988

Efficient Data Structures for Range Searching on a Grid.

Mark H. Overmars

J. Algorithms, 1988

Normalized Divide-and-Conquer: A Scaling Technique for Solving Multi-Dimensional Problems.

Rolf G. Karlsson, Mark H. Overmars

Inf. Process. Lett., 1988

Scanline Algorithms on a Grid.

Rolf G. Karlsson, Mark H. Overmars

BIT, 1988

A Balanced Search Tree with <i> O </i> (1) Worst-case Update Time.

Christos Levcopoulos, Mark H. Overmars

Acta Informatica, 1988

Dominance in the Presence of Obstracles.

Mark de Berg, Mark H. Overmars

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988

Connectability Problems.

Mark H. Overmars

Proceedings of the SWAT 88, 1988

Intersecting Line Segments, Ray Shooting, and Other Applications of Geometric Partitioning Techniques.

Leonidas J. Guibas, Mark H. Overmars, Micha Sharir

Proceedings of the SWAT 88, 1988

Maintaining Range Trees in Secondary Memory (Extended Abstract).

Mark H. Overmars, Michiel H. M. Smid

Proceedings of the STACS 88, 1988

New upper bounds in Klee's measure problem (extended abstract)

Mark H. Overmars, Chee-Keng Yap

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

New Methods for Computing Visibility Graphs.

Mark H. Overmars, Emo Welzl

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987

Zooming by Repeated Range Detection.

Herbert Edelsbrunner, Mark H. Overmars

Inf. Process. Lett., 1987

New Algorithms for Computer Graphics.

Mark H. Overmars

Proceedings of the Advances in Computer Graphics Hardware II (Eurographics'87 Workshop), 1987

Variations on Visibility.

J. Ian Munro, Mark H. Overmars, Derick Wood

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1985

Batched Dynamic Solutions to Decomposable Searching Problems.

Herbert Edelsbrunner, Mark H. Overmars

J. Algorithms, 1985

A simple method for solving 2-dimensional static range searching.

Mark H. Overmars, Emo Welzl

Bull. EATCS, 1985

The Inverted File Tree Machine: Efficient Multi-Key Retrieval for VLSI.

Hans-Peter Kriegel, Rita Mannss, Mark H. Overmars

Proceedings of the Foundations of Data Organization, 1985

The complexity of cutting paper (extended abstract).

Mark H. Overmars, Emo Welzl

Proceedings of the First Annual Symposium on Computational Geometry, 1985

Range searching in a set of line segments.

Mark H. Overmars

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984

Some methods of computational geometry applied to computer graphics.

Herbert Edelsbrunner, Mark H. Overmars, Raimund Seidel

Comput. Vis. Graph. Image Process., 1984

1983

Corrigendum: Dynamization of Order Decomposable Set Problems.

Mark H. Overmars

J. Algorithms, 1983

The Locus Approach.

Mark H. Overmars

Proceedings of the WG '83, 1983

The Design of Dynamic Data Structures

Mark H. Overmars

Lecture Notes in Computer Science 156, Springer, ISBN: 3-540-12330-X, 1983

1982

On the Equivalence of Some Rectangle Problems.

Herbert Edelsbrunner, Mark H. Overmars

Inf. Process. Lett., 1982

Dynamic Multi-Dimensional Data Structures Based on Quad- and <i> K - D </i> Trees.

Mark H. Overmars, Jan van Leeuwen

Acta Informatica, 1982

Stratified Balanced Search Trees.

Jan van Leeuwen, Mark H. Overmars

Acta Informatica, 1982

Lowerbounds and Upperbounds on VLSI-Layouts for Perfect Binary Trees.

Mark H. Overmars

Proceedings of the 8th Conference Graphtheoretic Concepts in Computer Science (WG '82), 1982

1981

Maintenance of Configurations in the Plane.

Mark H. Overmars, Jan van Leeuwen

J. Comput. Syst. Sci., 1981

Dynamization of Order Decomposable Set Problems.

Mark H. Overmars

J. Algorithms, 1981

Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems.

Mark H. Overmars, Jan van Leeuwen

Inf. Process. Lett., 1981

Some Principles for Dynamizing Decomposable Searching Problems.

Mark H. Overmars, Jan van Leeuwen

Inf. Process. Lett., 1981

General Methods for 'All Elements' and 'All Pairs' Problems.

Mark H. Overmars

Inf. Process. Lett., 1981

Optimal Dynamization of Decomposable Searching Problems.

Kurt Mehlhorn, Mark H. Overmars

Inf. Process. Lett., 1981

Two general methods for dynamizing decomposable searching problems.

Mark H. Overmars, Jan van Leeuwen

Computing, 1981

Transforming Semi-Dynamic Data Structures into Dynamic Structures.

Mark H. Overmars

Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981

Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds.

Mark H. Overmars, Jan van Leeuwen

Proceedings of the Theoretical Computer Science, 1981

The Art of Dynamizing.

Jan van Leeuwen, Mark H. Overmars

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1980

Further Comments on Bykat's Convex Hull Algorithm.

Mark H. Overmars, Jan van Leeuwen

Inf. Process. Lett., 1980

Dynamically Maintaining Configurations in the Plane (Detailed Abstract)

Mark H. Overmars, Jan van Leeuwen

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980