Mark H. Overmars

Publication Activity (10 Years)

Years Active: 1980-2012
Publications (10 Years): 0

Top Venues

IEEE Trans. Vis. Comput. Graph.

Comput. Geom.

Publications

Anka Gajentaan, Mark H. Overmars
) problems in computational geometry. Comput. Geom. 45 (4) (2012)
Ioannis Karamouzas, Mark H. Overmars
Simulating and Evaluating the Local Behavior of Small Pedestrian Groups. IEEE Trans. Vis. Comput. Graph. 18 (3) (2012)
Thomas Geijtenbeek, Nicolas Pronost, Arjan Egges, Mark H. Overmars
Interactive Character Animation using Simulated Physics. Eurographics (State of the Art Reports) (2011)
Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint
Computing Signed Permutations of Polygons. Int. J. Comput. Geom. Appl. 21 (1) (2011)
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) (2010)
Ioannis Karamouzas, Mark H. Overmars
Simulating the local behaviour of small pedestrian groups. VRST (2010)
Ioannis Karamouzas, Mark H. Overmars
Simulating Human Collision Avoidance Using a Velocity-Based Approach. VRIPHYS (2010)
Ioannis Karamouzas, Mark H. Overmars
A Velocity-Based Approach for Simulating Human Collision Avoidance. IVA (2010)
Ioannis Karamouzas, Jiri Bakker, Mark H. Overmars
Density constraints for crowd simulation. ICE-GIC (2009)
Arjan Egges, Arno Kamphuis, Mark H. Overmars
Guest editors' introduction: Special issue on gaming. Comput. Animat. Virtual Worlds 20 (5-6) (2009)
Ioannis Karamouzas, Roland Geraerts, Mark H. Overmars
Indicative routes for path planning and crowd simulation. FDG (2009)
Ioannis Karamouzas, Peter Heil, Pascal van Beek, Mark H. Overmars
A Predictive Collision Avoidance Model for Pedestrian Simulation. MIG (2009)
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)
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)
Ioannis Karamouzas, Mark H. Overmars
Adding variation to path planning. Comput. Animat. Virtual Worlds 19 (3-4) (2008)
Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin, Mark H. Overmars, Sue Whitesides
Realizing partitions respecting full and partial order information. J. Discrete Algorithms 6 (1) (2008)
Jur P. van den Berg, Mark H. Overmars
Planning Time-Minimal Safe Paths Amidst Unpredictably Moving Obstacles. Int. J. Robotics Res. 27 (11-12) (2008)
Mark H. Overmars, Ioannis Karamouzas, Roland Geraerts
Flexible Path Planning Using Corridor Maps. ESA (2008)
Mark de Berg, Dan Halperin, Mark H. Overmars
An intersection-sensitive algorithm for snap rounding. Comput. Geom. 36 (3) (2007)
Dennis Nieuwenhuisen, Jur P. van den Berg, Mark H. Overmars
Efficient path planning in changing environments. IROS (2007)
Roland Geraerts, Mark H. Overmars
The Corridor Map Method: Real-Time High-Quality Path Planning. ICRA (2007)
Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars
Pushing a Disk Using Compliance. IEEE Trans. Robotics 23 (3) (2007)
Jae-Sook Cheong, A. Frank van der Stappen, Kenneth Y. Goldberg, Mark H. Overmars, Elon Rimon
Immobilizing Hinged Polygons. Int. J. Comput. Geom. Appl. 17 (1) (2007)
Jur P. van den Berg, Mark H. Overmars
Kinodynamic motion planning on roadmaps in dynamic environments. IROS (2007)
Roland Geraerts, Mark H. Overmars
The corridor map method: a general framework for real-time high-quality path planning. Comput. Animat. Virtual Worlds 18 (2) (2007)
Roland Geraerts, Mark H. Overmars
Creating High-quality Paths for Motion Planning. Int. J. Robotics Res. 26 (8) (2007)
Roland Geraerts, Mark H. Overmars
Reachability-based analysis for Probabilistic Roadmap planners. Robotics Auton. Syst. 55 (11) (2007)
Dennis Nieuwenhuisen, Arno Kamphuis, Mark H. Overmars
High quality navigation in computer games. Sci. Comput. Program. 67 (1) (2007)
Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars
Pushing using Compliance. ICRA (2006)
Jur P. van den Berg, Mark H. Overmars
Computing Shortest Safe Path amidst Growing Discs in the Plane. Robot Navigation (2006)
Roland Geraerts, Mark H. Overmars
Creating High-quality Roadmaps for Motion Planning in Virtual Environments. IROS (2006)
Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir
Computing Maximally Separated Sets in the Plane. SIAM J. Comput. 36 (3) (2006)
Roland Geraerts, Mark H. Overmars
Sampling and node adding in probabilistic roadmap planners. Robotics Auton. Syst. 54 (2) (2006)
Jur P. van den Berg, Mark H. Overmars
Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles. WAFR (2006)
Mark H. Overmars
Scientific challenges ingame technology. VRST (2006)
Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars
An Effective Framework for Path Planning Amidst Movable Obstacles. WAFR (2006)
Jur P. van den Berg, Mark H. Overmars
Roadmap-based motion planning in dynamic environments. IEEE Trans. Robotics 21 (5) (2005)
Roland Geraerts, Mark H. Overmars
Reachability Analysis of Sampling Based Planners. ICRA (2005)
Jur P. van den Berg, Dennis Nieuwenhuisen, Leonard Jaillet, Mark H. Overmars
Creating robust roadmaps for motion planning in changing environments. IROS (2005)
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) (2005)
Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
Separating Point Sets in Polygonal Environments. Int. J. Comput. Geom. Appl. 15 (4) (2005)
Roland Geraerts, Mark H. Overmars
On improving the clearance for robots in high-dimensional configuration spaces. IROS (2005)
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) (2005)
Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars
Path planning for pushing a disk using compliance. IROS (2005)
Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen
TSP with neighborhoods of varying size. J. Algorithms 57 (1) (2005)
Jur P. van den Berg, Mark H. Overmars
Prioritized motion planning for multiple robots. IROS (2005)
Dennis Nieuwenhuisen, Mark H. Overmars
Motion Planning for Camera Movements. ICRA (2004)
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)
Mark H. Overmars
Teaching Computer Science through Game Design. Computer 37 (4) (2004)
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)
Arno Kamphuis, Mark H. Overmars
Motion Planning for Coherent Groups of Entities. ICRA (2004)
Dennis Nieuwenhuisen, Mark H. Overmars
Useful Cycles in Probabilistic Roadmap Graphs. ICRA (2004)
Onno C. Goemans, Mark H. Overmars
Automatic Generation of Camera Motion to Track a Moving Guide. WAFR (2004)
Roland Geraerts, Mark H. Overmars
Clearance based Path Optimization for Motion Planning. ICRA (2004)
Jur P. van den Berg, Mark H. Overmars
Using Workspace Information as a Guide to Non-uniform Sampling in Probabilistic Roadmap Planners. ICRA (2004)
Arno Kamphuis, Mark H. Overmars
Finding paths for coherent groups using clearance. Symposium on Computer Animation (2004)
Jur P. van den Berg, Mark H. Overmars
Roadmap-based motion planning in dynamic environments. IROS (2004)
Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars
On R-trees with low query complexity. Comput. Geom. 24 (3) (2003)
Michael A. Soss, Jeff Erickson, Mark H. Overmars
Preprocessing chains for fast dihedral rotations is hard or even impossible. Comput. Geom. 26 (3) (2003)
Mark H. Overmars
Finding Sets of Points without Empty Convex 6-Gons. Discret. Comput. Geom. 29 (1) (2003)
Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
Guarding scenes against invasive hypercubes. Comput. Geom. 26 (2) (2003)
Jae-Sook Cheong, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen
Fixturing Hinged Polygons. ICRA (2002)
Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen
TSP with Neighborhoods of Varying Size. ESA (2002)
Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold
Reporting intersecting pairs of convex polytopes in two and three dimensions. Comput. Geom. 23 (2) (2002)
Mark H. Overmars
Algorithms for Motion and Navigation in Virtual Environments and Games. WAFR (2002)
Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
Models and motion planning. Comput. Geom. 23 (1) (2002)
Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen
Orienting polyhedral parts by pushing. Comput. Geom. 21 (1-2) (2002)
Roland Geraerts, Mark H. Overmars
A Comparative Study of Probabilistic Roadmap Planners. WAFR (2002)
Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen
Sensorless Orientation of 3D Polyhedral Parts. ICRA (2002)
Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint
Computing signed permutations of polygons. CCCG (2002)
Greg Aloupis, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark H. Overmars, Michael A. Soss, Ileana Streinu, Godfried T. Toussaint
Flat-State Connectivity of Linkages under Dihedral Motions. ISAAC (2002)
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. Discret. Comput. Geom. 28 (2) (2002)
Mark H. Overmars
Recent Developments in Motion Planning. International Conference on Computational Science (3) (2002)
Michael A. Soss, Jeff Erickson, Mark H. Overmars
Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible CoRR (2002)
Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
Reconfiguring convex polygons. Comput. Geom. 20 (1-2) (2001)
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)
Mike Tao Zhang, Kenneth Y. Goldberg, Gordon Smith, Robert-Paul Berretty, Mark H. Overmars
Pin design for part feeding. Robotica 19 (6) (2001)
Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen
Orienting Parts by Inside-out Pulling. ICRA (2001)
Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen
Trap Design for Vibratory Bowl Feeders. Int. J. Robotics Res. 20 (11) (2001)
Danielle Sent, Mark H. Overmars
Motion Planning in Environments with Dangerzones. ICRA (2001)
Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
Locked and Unlocked Polygonal Chains in Three Dimensions. Discret. Comput. Geom. 26 (3) (2001)
Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
Reconfiguring Convex Polygons. CCCG (2000)
Michiel Hagedoorn, Mark H. Overmars, Remco C. Veltkamp
A Robust Affine Invariant Similarity Measure Based on Visibility. EuroCG (2000)
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)
A. Frank van der Stappen, Chantal Wentink, Mark H. Overmars
Computing Immobilizing Grasps of Polygonal Parts. Int. J. Robotics Res. 19 (5) (2000)
Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars
On R-trees with Low Stabbing Number. ESA (2000)
A. Frank van der Stappen, Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars
Geometry and Part Feeding. Sensor Based Intelligent Robots (2000)
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 (2000)
Michiel Hagedoorn, Mark H. Overmars, Remco C. Veltkamp
A New Visibility Partition for Affine Pattern Matching. DGCI (2000)
Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen
Orienting Polyhedral Parts by Pushing. EuroCG (2000)
Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen
Geometric Algorithms for Trap Design. SCG (1999)
A. Frank van der Stappen, Chantal Wentink, Mark H. Overmars
Computing Form-Closure Configurations. ICRA (1999)
Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
Locked and Unlocked Polygonal Chains in 3D CoRR (1999)
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)
Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
Locked and Unlocked Polygonal Chains in 3D. SODA (1999)
Valérie Boor, Mark H. Overmars, A. Frank van der Stappen
The Gaussian Sampling Strategy for Probabilistic Roadmap Planners. ICRA (1999)
Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen
Dynamic motion planning in low obstacle density environments. Comput. Geom. 11 (3-4) (1998)
Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen
Computing fence designs for orienting parts. Comput. Geom. 10 (4) (1998)
Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong
Computing the Angularity Tolerance. Int. J. Comput. Geom. Appl. 8 (4) (1998)
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) (1998)

Mark H. Overmars.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mark H. Overmars