Mark H. Overmars

	2012
223		Anka Gajentaan, Mark H. Overmars: On a class of O(n2) problems in computational geometry. Comput. Geom. 45(4): 140-152 (2012)
222		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
221		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. Geometry Appl. 21(1): 87-100 (2011)
	2010
220		Ioannis Karamouzas, Mark H. Overmars: A Velocity-Based Approach for Simulating Human Collision Avoidance. IVA 2010: 180-186
219		Ioannis Karamouzas, Mark H. Overmars: Simulating Human Collision Avoidance Using a Velocity-Based Approach. VRIPHYS 2010: 125-134
218		Ioannis Karamouzas, Mark H. Overmars: Simulating the local behaviour of small pedestrian groups. VRST 2010: 183-190
217		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)
	2009
216		Arjan Egges, Roland Geraerts, Mark H. Overmars: Motion in Games, Second International Workshop, MIG 2009, Zeist, The Netherlands, November 21-24, 2009. Proceedings Springer 2009
215		Ioannis Karamouzas, Roland Geraerts, Mark H. Overmars: Indicative routes for path planning and crowd simulation. FDG 2009: 113-120
214		Ioannis Karamouzas, Peter Heil, Pascal van Beek, Mark H. Overmars: A Predictive Collision Avoidance Model for Pedestrian Simulation. MIG 2009: 41-52
213		Arjan Egges, Arno Kamphuis, Mark H. Overmars: Guest editors' introduction: Special issue on gaming. Journal of Visualization and Computer Animation 20(5-6): (2009)
	2008
212		Arjan Egges, Arno Kamphuis, Mark H. Overmars: Motion in Games, First International Workshop, MIG 2008, Utrecht, The Netherlands, June 14-17, 2008. Revised Papers Springer 2008
211		Mark H. Overmars, Ioannis Karamouzas, Roland Geraerts: Flexible Path Planning Using Corridor Maps. ESA 2008: 1-12
210		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
209		Jur P. van den Berg, Mark H. Overmars: Planning Time-Minimal Safe Paths Amidst Unpredictably Moving Obstacles. I. J. Robotic Res. 27(11-12): 1274-1294 (2008)
208		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): 51-58 (2008)
207		Ioannis Karamouzas, Mark H. Overmars: Adding variation to path planning. Journal of Visualization and Computer Animation 19(3-4): 283-293 (2008)
	2007
206		Roland Geraerts, Mark H. Overmars: The Corridor Map Method: Real-Time High-Quality Path Planning. ICRA 2007: 1023-1028
205		Dennis Nieuwenhuisen, Jur P. van den Berg, Mark H. Overmars: Efficient path planning in changing environments. IROS 2007: 3295-3301
204		Jur P. van den Berg, Mark H. Overmars: Kinodynamic motion planning on roadmaps in dynamic environments. IROS 2007: 4253-4258
203		Mark de Berg, Dan Halperin, Mark H. Overmars: An intersection-sensitive algorithm for snap rounding. Comput. Geom. 36(3): 159-165 (2007)
202		Roland Geraerts, Mark H. Overmars: Creating High-quality Paths for Motion Planning. I. J. Robotic Res. 26(8): 845-863 (2007)
201		Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars: Pushing a Disk Using Compliance. IEEE Transactions on Robotics 23(3): 431-442 (2007)
200		Jae-Sook Cheong, A. Frank van der Stappen, Kenneth Y. Goldberg, Mark H. Overmars, Elon Rimon: Immobilizing Hinged Polygons. Int. J. Comput. Geometry Appl. 17(1): 45-70 (2007)
199		Roland Geraerts, Mark H. Overmars: The corridor map method: a general framework for real-time high-quality path planning. Journal of Visualization and Computer Animation 18(2): 107-119 (2007)
198		Roland Geraerts, Mark H. Overmars: Reachability-based analysis for Probabilistic Roadmap planners. Robotics and Autonomous Systems 55(11): 824-836 (2007)
197		Dennis Nieuwenhuisen, Arno Kamphuis, Mark H. Overmars: High quality navigation in computer games. Sci. Comput. Program. 67(1): 91-104 (2007)
	2006
196		Jacob Habgood, Mark H. Overmars: The game maker's apprentice - game development for beginners. Apress 2006: I-XX, 1-311
195		Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars: Pushing using Compliance. ICRA 2006: 2010-2016
194		Roland Geraerts, Mark H. Overmars: Creating High-quality Roadmaps for Motion Planning in Virtual Environments. IROS 2006: 4355-4361
193		Jur P. van den Berg, Mark H. Overmars: Computing Shortest Safe Path amidst Growing Discs in the Plane. Robot Navigation 2006
192		Mark H. Overmars: Scientific challenges ingame technology. VRST 2006: 1
191		Jur P. van den Berg, Mark H. Overmars: Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles. WAFR 2006: 103-118
190		Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars: An Effective Framework for Path Planning Amidst Movable Obstacles. WAFR 2006: 87-102
189		Roland Geraerts, Mark H. Overmars: Sampling and node adding in probabilistic roadmap planners. Robotics and Autonomous Systems 54(2): 165-173 (2006)
188		Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir: Computing Maximally Separated Sets in the Plane. SIAM J. Comput. 36(3): 815-834 (2006)
	2005
187		Roland Geraerts, Mark H. Overmars: Reachability Analysis of Sampling Based Planners. ICRA 2005: 404-410
186		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
185		Jur P. van den Berg, Mark H. Overmars: Prioritized motion planning for multiple robots. IROS 2005: 430-435
184		Roland Geraerts, Mark H. Overmars: On improving the clearance for robots in high-dimensional configuration spaces. IROS 2005: 679-684
183		Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars: Path planning for pushing a disk using compliance. IROS 2005: 714-720
182		Michael Erdmann, David Hsu, Mark H. Overmars, A. Frank van der Stappen: Editorial: Special Issue on WAFR 2004. I. J. Robotic Res. 24(11): 881-882 (2005)
181		Jur P. van den Berg, Mark H. Overmars: Using Workspace Information as a Guide to Non-uniform Sampling in Probabilistic Roadmap Planners. I. J. Robotic Res. 24(12): 1055-1071 (2005)
180		Jur P. van den Berg, Mark H. Overmars: Roadmap-based motion planning in dynamic environments. IEEE Transactions on Robotics 21(5): 885-897 (2005)
179		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. Geometry Appl. 15(4): 403-420 (2005)
178		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): 22-36 (2005)
	2004
177		Roland Geraerts, Mark H. Overmars: Clearance based Path Optimization for Motion Planning. ICRA 2004: 2386-2392
176		Arno Kamphuis, Mark H. Overmars: Motion Planning for Coherent Groups of Entities. ICRA 2004: 3815-3822
175		Dennis Nieuwenhuisen, Mark H. Overmars: Motion Planning for Camera Movements. ICRA 2004: 3870-3876
174		Dennis Nieuwenhuisen, Mark H. Overmars: Useful Cycles in Probabilistic Roadmap Graphs. ICRA 2004: 446-452
173		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
172		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
171		Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides: Separating point sets in polygonal environments. Symposium on Computational Geometry 2004: 10-16
170		Mark H. Overmars: Teaching Computer Science through Game Design. IEEE Computer 37(4): 81-83 (2004)
	2003
169		Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars: On R-trees with low query complexity. Comput. Geom. 24(3): 179-195 (2003)
168		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): 99-117 (2003)
167		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)
166		Mark H. Overmars: Finding Sets of Points without Empty Convex 6-Gons. Discrete & Computational Geometry 29(1): 153-158 (2003)
	2002
165		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
164		Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen: TSP with Neighborhoods of Varying Size. ESA 2002: 187-199
163		Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen: Sensorless Orientation of 3D Polyhedral Parts. ICRA 2002: 2016-2021
162		Jae-Sook Cheong, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen: Fixturing Hinged Polygons. ICRA 2002: 876-881
161		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: 369-380
160		Mark H. Overmars: Recent Developments in Motion Planning. International Conference on Computational Science (3) 2002: 3-13
159		Michael A. Soss, Jeff Erickson, Mark H. Overmars: Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible CoRR cs.CG/0204042: (2002)
158		Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen: Orienting polyhedral parts by pushing. Comput. Geom. 21(1-2): 21-38 (2002)
157		Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels: Models and motion planning. Comput. Geom. 23(1): 53-68 (2002)
156		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): 195-207 (2002)
	2001
155		Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen: Orienting Parts by Inside-out Pulling. ICRA 2001: 1053-1058
154		Danielle Sent, Mark H. Overmars: Motion Planning in Environments with Dangerzones. ICRA 2001: 1488-1493
153		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
152		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): 85-95 (2001)
151		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. Discrete & Computational Geometry 26(3): 269-281 (2001)
150		Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen: Trap Design for Vibratory Bowl Feeders. I. J. Robotic Res. 20(11): 891-908 (2001)
149		Mike Tao Zhang, Kenneth Y. Goldberg, Gordon Smith, Robert-Paul Berretty, Mark H. Overmars: Pin design for part feeding. Robotica 19(6): 695-702 (2001)
	2000
148		Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint: Reconfiguring Convex Polygons. CCCG 2000
147		Michiel Hagedoorn, Mark H. Overmars, Remco C. Veltkamp: A New Visibility Partition for Affine Pattern Matching. DGCI 2000: 358-370
146		Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars: On R-trees with Low Stabbing Number. ESA 2000: 167-178
145		Michiel Hagedoorn, Mark H. Overmars, Remco C. Veltkamp: A Robust Affine Invariant Similarity Measure Based on Visibility. EuroCG 2000: 112-116
144		Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen: Orienting Polyhedral Parts by Pushing. EuroCG 2000: 136-139
143		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
142		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
141		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)
140		A. Frank van der Stappen, Chantal Wentink, Mark H. Overmars: Computing Immobilizing Grasps of Polygonal Parts. I. J. Robotic Res. 19(5): 467-479 (2000)
	1999
139		Valérie Boor, Mark H. Overmars, A. Frank van der Stappen: The Gaussian Sampling Strategy for Probabilistic Roadmap Planners. ICRA 1999: 1018-1023
138		A. Frank van der Stappen, Chantal Wentink, Mark H. Overmars: Computing Form-Closure Configurations. ICRA 1999: 1837-1842
137		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
136		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: 866-867
135		Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen: Geometric Algorithms for Trap Design. Symposium on Computational Geometry 1999: 95-104
134		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 cs.CG/9910009: (1999)
	1998
133		Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels: Guarding Scenes against Invasive Hypercubes. Algorithm Engineering 1998: 110-120
132		Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Mark H. Overmars, Joseph O'Rourke, Steve Robbins, Sue Whitesides: Unfolding some classes of orthogonal polyhedra. CCCG 1998
131		Mark H. Overmars: Geometric Algorithms for Robotic Manipulation. ICALP 1998: 116-117
130		Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels: Models and Motion Planning. SWAT 1998: 83-94
129		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 cs.CG/9811019: (1998)
128		Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen: Computing fence designs for orienting parts. Comput. Geom. 10(4): 249-262 (1998)
127		Dan Halperin, Mark H. Overmars: Spheres, molecules, and hidden surface removal. Comput. Geom. 11(2): 83-102 (1998)
126		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)
125		Johan W. H. Tangelder, Joris S. M. Vergeest, Mark H. Overmars: Interference-free NC machining using spatial planning and Minkowski operations. Computer-Aided Design 30(4): 277-286 (1998)
124		A. Frank van der Stappen, Mark H. Overmars, Mark de Berg, Jules Vleugels: Motion Planning in Environments with Low Obstacle Density. Discrete & Computational Geometry 20(4): 561-587 (1998)
123		Jules Vleugels, Mark H. Overmars: Approximating Voronoi Diagrams of Convex Sites in any Dimension. Int. J. Comput. Geometry Appl. 8(2): 201-222 (1998)
122		Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong: Computing the Angularity Tolerance. Int. J. Comput. Geometry Appl. 8(4): 467- (1998)
121		Petr Svestka, Mark H. Overmars: Coordinated path planning for multiple robots. Robotics and Autonomous Systems 23(3): 125-152 (1998)
	1997
120		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. Symposium on Computational Geometry 1997: 21-29
119		Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen: Dynamic Motion Planning in Low Obstacle Density Environments. WADS 1997: 3-16
118		Mark H. Overmars, Nicola Santoro: Improved Bounds for Electing a Leader in a Synchronous Ring. Algorithmica 18(2): 246-262 (1997)
117		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)
116		Mark de Berg, Marko de Groot, Mark H. Overmars: Perfect Binary Space Partitions. Comput. Geom. 7: 81-91 (1997)
115		Mark de Berg, Marko de Groot, Mark H. Overmars: New Results on Binary Space Partitions in the Plane. Comput. Geom. 8: 317-333 (1997)
114		Petr Svestka, Mark H. Overmars: Motion Planning for Carlike Robots Using a Probabilistic Learning Approach. I. J. Robotic Res. 16(2): 119-143 (1997)
113		Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia: The Floodlight Problem. Int. J. Comput. Geometry Appl. 7(1/2): 153-163 (1997)
112		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. Geometry Appl. 7(3): 175-195 (1997)
111		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)
110		Mark de Berg, Marc J. van Kreveld, René van Oostrum, Mark H. Overmars: Simple Traversal of a Subdivision Without Extra Storage. International Journal of Geographical Information Science 11(4): 359-373 (1997)
	1996
109		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
108		Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong: Computing the Angularity Tolerance. CCCG 1996: 331-336
107		Chantal Wentink, A. Frank van der Stappen, Mark H. Overmars: Fixture Design with Edge-Fixels. Intelligent Robots 1996: 269-286
106		Mark H. Overmars, Petr Svestka: Probabilistic Approaches to Motion Planning. SOFSEM 1996: 95-112
105		Mark de Berg, René van Oostrum, Mark H. Overmars: Simple Traversal of a Subdivision Without Extra Storage. Symposium on Computational Geometry 1996: C-5-C-6
104		Mark H. Overmars: Designing the Computational Geometry Algorithms Library CGAL. WACG 1996: 53-58
103		Leonidas J. Guibas, Mark H. Overmars, Jean-Marc Robert: The Exact Fitting Problem in Higher Dimensions. Comput. Geom. 6: 215-230 (1996)
102		Jules Vleugels, Vincenzo Ferrucci, Mark H. Overmars, Anil S. Rao: Hunting Voronoi Vertices. Comput. Geom. 6: 329-354 (1996)
101		Mark H. Overmars, A. Frank van der Stappen: Range Searching and Point Location among Fat Objects. J. Algorithms 21(3): 629-656 (1996)
	1995
100		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-
99		Petr Svestka, Mark H. Overmars: Coordinated Motion Planning for Multiple Car-Like Robots Using Probabilistic Roadmaps. ICRA 1995: 1631-1636
98		Mark H. Overmars, Anil S. Rao, Otfried Schwarzkopf, Chantal Wentink: Immobilizing Polygons against a Wall. Symposium on Computational Geometry 1995: 29-38
97		Berto van de Kraats, Marc J. van Kreveld, Mark H. Overmars: Printed Circuit Board Simplification: Simplifying Subdivisions in Practice. Symposium on Computational Geometry 1995: C30-C31
96		Anka Gajentaan, Mark H. Overmars: On a Class of O(n2) Problems in Computational Geometry. Comput. Geom. 5: 165-185 (1995)
95		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)
	1994
94		Vincenzo Ferrucci, Mark H. Overmars, Anil S. Rao, Jules Vleugels: Hunting Voronoi Vertices in Non-Polygonal Domains. CCCG 1994: 45-50
93		Mark H. Overmars, A. Frank van der Stappen: Range Searching and Point Location among Fat Objects. ESA 1994: 240-253
92		Mark de Berg, Marko de Groot, Mark H. Overmars: New Results on Binary Space Partitions in the Plane (Extended Abstract). SWAT 1994: 61-72
91		Dan Halperin, Mark H. Overmars: Spheres, Molecules, and Hidden Surface Removal. Symposium on Computational Geometry 1994: 113-122
90		A. Frank van der Stappen, Mark H. Overmars: Motion Planning Amidst Fat Obstacles (Extended Abstract). Symposium on Computational Geometry 1994: 31-40
89		Mark H. Overmars, Micha Sharir: An Improved Technique for Output-Sensitive Hidden Surface Removal. Algorithmica 11(5): 469-484 (1994)
88		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)
87		Marc J. van Kreveld, Mark H. Overmars: Concatenable Structures for Decomposable Problems Inf. Comput. 110(1): 130-148 (1994)
86		John Adegeest, Mark H. Overmars, Jack Snoeyink: Minimum-link C-oriented paths: Single-source queries. Int. J. Comput. Geometry Appl. 4(1): 39-51 (1994)
85		Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf: Computing and Verifying Depth Orders. SIAM J. Comput. 23(2): 437-446 (1994)
	1993
84		Mark de Berg, Marko de Groot, Mark H. Overmars: Perfect Binary Space Partitions. CCCG 1993: 109-114
83		Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia: The Floodlight Problem. CCCG 1993: 399-404
82		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
81		A. Frank van der Stappen, Dan Halperin, Mark H. Overmars: Efficient Algorithms for Exact Motion Planning Amidst Fat Obstacles. ICRA (1) 1993: 297-304
80		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
79		A. Frank van der Stappen, Dan Halperin, Mark H. Overmars: The Complexity of the Free Space for a Robot Moving Amidst Fat Obstacles. Comput. Geom. 3: 353-373 (1993)
78		Johannes A. La Poutré, Jan van Leeuwen, Mark H. Overmars: Maintenance of 2- and 3-edge- connected components of graphs I. Discrete Mathematics 114(1-3): 329-359 (1993)
77		Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars: Output-Sensitive Methods for Rectilinear Hidden Surface Removal Inf. Comput. 107(1): 1-24 (1993)
76		Marc J. van Kreveld, Mark H. Overmars: Union-Copy Structures and Dynamic Segment Trees. J. ACM 40(3): 635-652 (1993)
75		Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars: Intersection Queries in Curved Objects. J. Algorithms 15(2): 229-266 (1993)
	1992
74		Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf: Computing and Verifying Depth Orders. Symposium on Computational Geometry 1992: 138-145
73		Micha Sharir, Mark H. Overmars: A Simple Output-Sensitive Algorithm for Hidden Surface Removal. ACM Trans. Graph. 11(1): 1-11 (1992)
72		Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal: Intersection Queries in Sets of Disks. BIT 32(2): 268-279 (1992)
71		Matthew J. Katz, Mark H. Overmars, Micha Sharir: Efficient Hidden Surface Removal for Objects with Small Union Size. Comput. Geom. 2: 223-234 (1992)
70		David Eppstein, Mark H. Overmars, Günter Rote, Gerhard J. Woeginger: Finding Minimum Area k-gons. Discrete & Computational Geometry 7: 45-58 (1992)
69		Mark H. Overmars: Point Location in Fat Subdivisions. Inf. Process. Lett. 44(5): 261-265 (1992)
68		Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars: Shortest path queries in rectilinear worlds. Int. J. Comput. Geometry Appl. 2(3): 287-309 (1992)
67		Mark de Berg, Svante Carlsson, Mark H. Overmars: A General Approach to Dominance in the Plane. J. Algorithms 13(2): 274-296 (1992)
66		Dan Halperin, Mark H. Overmars, Micha Sharir: Efficient Motion Planning for an L-Shaped Object. SIAM J. Comput. 21(1): 1-23 (1992)
	1991
65		Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld: Efficient Ray Shooting and Hidden Surface Removal. Symposium on Computational Geometry 1991: 21-30
64		Matthew J. Katz, Mark H. Overmars, Micha Sharir: Efficient Hidden Surface Removal for Objects with small Union Size. Symposium on Computational Geometry 1991: 31-40
63		Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars: Intersection Queries for Curved Objects (Extended Abstract). Symposium on Computational Geometry 1991: 41-50
62		Marc J. van Kreveld, Mark H. Overmars: Divided k-d Trees. Algorithmica 6(6): 840-858 (1991)
61		Haijo Schipper, Mark H. Overmars: Dynamic Partition Trees. BIT 31(3): 421-436 (1991)
60		Mark de Berg, Mark H. Overmars: Hidden Surface Removal for C-oriented Polyhedra. Comput. Geom. 1: 247-268 (1991)
59		Mark H. Overmars, Micha Sharir: Merging Visibility Maps. Comput. Geom. 1: 35-49 (1991)
58		Mark H. Overmars, Chee-Keng Yap: New Upper Bounds in Klee's Measure Problem. SIAM J. Comput. 20(6): 1034-1045 (1991)
	1990
57		Mark de Berg, Mark H. Overmars: Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract) FOCS 1990: 252-261
56		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
55		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
54		Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal: Intersection Queries in Sets of Disks. SWAT 1990: 393-403
53		Haijo Schipper, Mark H. Overmars: Dynamic Partition Trees. SWAT 1990: 404-417
52		Mark H. Overmars, Micha Sharir: Merging Visibility Maps. Symposium on Computational Geometry 1990: 168-176
51		David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars: Searching for Empty Convex Polygons. Algorithmica 5(4): 561-571 (1990)
50		Mark H. Overmars, Haijo Schipper, Micha Sharir: Storing Line Segments in Partition Trees. BIT 30(3): 385-403 (1990)
	1989
49		Mark H. Overmars: Computational Geometry and its Application to Computer Graphics. Advances in Computer Graphics 1989: 75-107
48		Mark H. Overmars, Micha Sharir: Output-Sensitive Hidden Surface Removal FOCS 1989: 598-603
47		Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas: Multiple Representations of Dynamic Data Structures. IFIP Congress 1989: 437-442
46		Mark H. Overmars, Nicola Santoro: TIME vs BITS. STACS 1989: 282-293
45		Marc J. van Kreveld, Mark H. Overmars: Concatenable Segment Trees (Extended Abstract). STACS 1989: 493-504
44		Dan Halperin, Mark H. Overmars: Efficient Motion Planning for an L-Shaped Object. Symposium on Computational Geometry 1989: 156-166
43		Mark H. Overmars, Michiel H. M. Smid, Mark de Berg, Marc J. van Kreveld: Maintaining Range Trees in Secondary Memory. Part I: Partitions. Acta Inf. 27(5): 423-452 (1989)
42		Michiel H. M. Smid, Mark H. Overmars: Maintaining Range Trees in Secondary Memory. Part II: Lower Bounds. Acta Inf. 27(5): 453-480 (1989)
41		Mark H. Overmars, Bertha Scholten, Ingrid Vincent: Sets without emtpy convex 6-gons. Bulletin of the EATCS 37: 160-167 (1989)
40		Michiel H. M. Smid, Leen Torenvliet, Peter van Emde Boas, Mark H. Overmars: Two Models for the Reconstruction Problem for Dynamic Data Structures. Elektronische Informationsverarbeitung und Kybernetik 25(4): 131-155 (1989)
39		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)
38		Patrick Lentfert, Mark H. Overmars: Data Structures in a Real-Time Environment. Inf. Process. Lett. 31(3): 151-155 (1989)
37		Hans W. Scholten, Mark H. Overmars: General Methods for Adding Range Restrictions to Decomposable Searching Problems. J. Symb. Comput. 7(1): 1-10 (1989)
	1988
36		Mark H. Overmars, Chee-Keng Yap: New upper bounds in Klee's measure problem (extended abstract) FOCS 1988: 550-556
35		Mark H. Overmars, Michiel H. M. Smid: Maintaining Range Trees in Secondary Memory (Extended Abstract). STACS 1988: 38-51
34		Mark H. Overmars: Connectability Problems. SWAT 1988: 105-112
33		Leonidas J. Guibas, Mark H. Overmars, Micha Sharir: Intersecting Line Segments, Ray Shooting, and Other Applications of Geometric Partitioning Techniques. SWAT 1988: 64-73
32		Mark H. Overmars, Emo Welzl: New Methods for Computing Visibility Graphs. Symposium on Computational Geometry 1988: 164-171
31		David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars: Searching for Empty Convex Polygons. Symposium on Computational Geometry 1988: 224-228
30		Mark de Berg, Mark H. Overmars: Dominance in the Presence of Obstracles. WG 1988: 190-201
29		Christos Levcopoulos, Mark H. Overmars: A Balanced Search Tree with O (1) Worst-case Update Time. Acta Inf. 26(3): 269-277 (1988)
28		Rolf G. Karlsson, Mark H. Overmars: Scanline Algorithms on a Grid. BIT 28(2): 227-241 (1988)
27		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)
26		Mark H. Overmars: Efficient Data Structures for Range Searching on a Grid. J. Algorithms 9(2): 254-275 (1988)
25		Mark H. Overmars, Derick Wood: On Rectangular Visibility. J. Algorithms 9(3): 372-390 (1988)
	1987
24		Mark H. Overmars: New Algorithms for Computer Graphics. Advances in Computer Graphics Hardware 1987: 3-19
23		J. Ian Munro, Mark H. Overmars, Derick Wood: Variations on Visibility. Symposium on Computational Geometry 1987: 291-299
22		Herbert Edelsbrunner, Mark H. Overmars: Zooming by Repeated Range Detection. Inf. Process. Lett. 24(6): 413-417 (1987)
	1985
21		Hans-Peter Kriegel, Rita Mannss, Mark H. Overmars: The Inverted File Tree Machine: Efficient Multi-Key Retrieval for VLSI. FODO 1985: 279-291
20		Mark H. Overmars: Range searching in a set of line segments. Symposium on Computational Geometry 1985: 177-185
19		Mark H. Overmars, Emo Welzl: The complexity of cutting paper (extended abstract). Symposium on Computational Geometry 1985: 316-321
18		Mark H. Overmars, Emo Welzl: A simple method for solving 2-dimensional static range searching. Bulletin of the EATCS 25: 31-33 (1985)
17		Herbert Edelsbrunner, Mark H. Overmars: Batched Dynamic Solutions to Decomposable Searching Problems. J. Algorithms 6(4): 515-542 (1985)
	1984
16		Herbert Edelsbrunner, Mark H. Overmars, Raimund Seidel: Some methods of computational geometry applied to computer graphics. Computer Vision, Graphics, and Image Processing 28(1): 92-108 (1984)
	1983
15		Mark H. Overmars: The Design of Dynamic Data Structures Springer 1983
14		Mark H. Overmars: Corrigendum: Dynamization of Order Decomposable Set Problems. J. Algorithms 4(3): 301 (1983)
	1982
13		Mark H. Overmars, Jan van Leeuwen: Dynamic Multi-Dimensional Data Structures Based on Quad- and K - D Trees. Acta Inf. 17: 267-285 (1982)
12		Jan van Leeuwen, Mark H. Overmars: Stratified Balanced Search Trees. Acta Inf. 18: 345-359 (1982)
11		Herbert Edelsbrunner, Mark H. Overmars: On the Equivalence of Some Rectangle Problems. Inf. Process. Lett. 14(3): 124-127 (1982)
	1981
10		Jan van Leeuwen, Mark H. Overmars: The Art of Dynamizing. MFCS 1981: 121-131
9		Mark H. Overmars, Jan van Leeuwen: Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds. Theoretical Computer Science 1981: 224-233
8		Mark H. Overmars, Jan van Leeuwen: Some Principles for Dynamizing Decomposable Searching Problems. Inf. Process. Lett. 12(1): 49-53 (1981)
7		Kurt Mehlhorn, Mark H. Overmars: Optimal Dynamization of Decomposable Searching Problems. Inf. Process. Lett. 12(2): 93-98 (1981)
6		Mark H. Overmars: General Methods for `All Elements' and `All Pairs' Problems. Inf. Process. Lett. 12(2): 99-102 (1981)
5		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)
4		Mark H. Overmars: Dynamization of Order Decomposable Set Problems. J. Algorithms 2(3): 245-260 (1981)
3		Mark H. Overmars, Jan van Leeuwen: Maintenance of Configurations in the Plane. J. Comput. Syst. Sci. 23(2): 166-204 (1981)
	1980
2		Mark H. Overmars, Jan van Leeuwen: Dynamically Maintaining Configurations in the Plane (Detailed Abstract) STOC 1980: 135-145
1		Mark H. Overmars, Jan van Leeuwen: Further Comments on Bykat's Convex Hull Algorithm. Inf. Process. Lett. 10(4/5): 209-212 (1980)

Coauthor Index

1	John Adegeest	[86]
2	Pankaj K. Agarwal	[54] [63] [72] [75] [153] [156] [172] [188]
3	Oswin Aichholzer	[141] [148] [152]
4	Greg Aloupis	[161] [165] [221]
5	Boudewijn Asberg	[82] [117]
6	Mikhail J. Atallah	[56] [77]
7	Ben J. H. van Basten	[217]
8	Pascal van Beek	[214]
9	Jur P. van den Berg (Jur van den Berg)	[173] [180] [181] [185] [186] [191] [193] [204] [205] [209]
10	Mark de Berg	[30] [43] [55] [57] [60] [65] [67] [68] [74] [80] [84] [85] [88] [92] [95] [100] [105] [108] [109] [110] [112] [115] [116] [122] [124] [130] [133] [146] [153] [156] [157] [164] [168] [169] [178] [203]
11	Robert-Paul Berretty	[119] [120] [126] [128] [135] [137] [142] [143] [144] [149] [150] [155] [158] [163]
12	Therese C. Biedl	[129] [132] [134] [136] [151]
13	Gregoria Blanco	[82] [117]
14	Peter van Emde Boas	[39] [40] [47]
15	Valérie Boor	[139]
16	Prosenjit Bose	[82] [83] [109] [113] [117] [165] [221]
17	Svante Carlsson	[67]
18	Jae-Sook Cheong	[162] [200]
19	Otfried Cheong (Otfried Schwarzkopf)	[74] [80] [85] [95] [98]
20	Lawrence Cheung	[137]
21	Carmen Cortés	[141]
22	Haggai David	[133] [168]
23	Erik D. Demaine	[129] [132] [134] [136] [141] [148] [151] [152] [161] [165] [171] [179] [208] [221]
24	Martin L. Demaine	[129] [132] [134] [136] [151]
25	David P. Dobkin	[31] [51]
26	Katrin Dobrindt	[109]
27	Vida Dujmovic	[141] [161]
28	Herbert Edelsbrunner	[11] [16] [17] [22] [31] [51]
29	Arjan Egges	[212] [213] [216] [217]
30	David Eppstein	[70]
31	Michael Erdmann	[182]
32	Jeff Erickson	[141] [148] [152] [159] [161] [167] [171] [179] [208]
33	Vincenzo Ferrucci	[94] [102]
34	Anka Gajentaan	[96] [223]
35	Jesus Garcia-Lopez	[82] [117]
36	Roland Geraerts	[177] [184] [187] [189] [194] [198] [199] [202] [206] [210] [211] [215] [216]
37	Kenneth Y. Goldberg	[120] [128] [135] [137] [142] [143] [149] [150] [155] [162] [200]
38	Michael T. Goodrich	[56] [77]
39	Marko de Groot	[84] [92] [109] [115] [116]
40	Joachim Gudmundsson	[146] [164] [169] [178]
41	Leonidas J. Guibas	[33] [80] [83] [95] [103] [113]
42	Jacob Habgood	[196]
43	Michiel Hagedoorn	[145] [147]
44	Dan Halperin	[44] [65] [66] [79] [80] [81] [88] [91] [95] [112] [127] [203]
45	Mikael Hammar	[146] [169]
46	Sariel Har-Peled	[153] [156]
47	Peter Heil	[214]
48	David Hsu	[182]
49	Ferran Hurtado	[148] [152] [171] [179]
50	John Iacono	[171] [179]
51	Leonard Jaillet	[186]
52	Arno Kamphuis	[176] [197] [210] [212] [213]
53	Ioannis Karamouzas	[207] [210] [211] [214] [215] [218] [219] [220] [222]
54	Rolf G. Karlsson	[27] [28]
55	Matthew J. Katz (Matya Katz)	[64] [71] [130] [133] [157] [164] [168] [178]
56	Joost N. Kok	[111]
57	Berto van de Kraats	[97]
58	Marc J. van Kreveld	[43] [45] [54] [55] [62] [63] [65] [68] [72] [75] [76] [87] [88] [97] [100] [109] [110] [112]
59	Hans-Peter Kriegel	[21]
60	Danny Krizanc	[208]
61	Stefan Langerman	[161] [165] [171] [179] [221]
62	Sylvain Lazard	[129] [134] [136] [151]
63	Jan van Leeuwen	[1] [2] [3] [5] [8] [9] [10] [12] [13] [78]
64	Patrick Lentfert	[38]
65	Christos Levcopoulos	[29] [164] [178]
66	Anna Lubiw	[83] [113] [129] [132] [134] [136] [151]
67	Rita Mannss	[21]
68	Kurt Mehlhorn	[7]
69	Henk Meijer	[108] [122] [141] [161] [165] [171] [179] [208] [221]
70	Pat Morin	[208]
71	J. Ian Munro	[23]
72	Dennis Nieuwenhuisen	[174] [175] [183] [186] [190] [195] [197] [201] [205]
73	Bengt J. Nilsson	[55] [68]
74	Joseph O'Rourke	[129] [132] [134] [136] [151] [161]
75	René van Oostrum	[100] [105] [110]
76	Belén Palop	[141]
77	Johannes A. La Poutré (Han La Poutré)	[78]
78	Suneeta Ramaswami	[141]
79	Anil S. Rao	[94] [98] [102]
80	Elon Rimon	[200]
81	Steve Robbins	[129] [132] [134] [136] [151]
82	Jean-Marc Robert	[103]
83	Thomas Roos	[109]
84	Günter Rote	[70]
85	Zsófia Ruttkay	[217]
86	Nicola Santoro	[46] [118]
87	Haijo Schipper	[50] [53] [61]
88	Bertha Scholten	[41]
89	Hans W. Scholten	[37]
90	Raimund Seidel	[16]
91	Danielle Sent	[154]
92	Micha Sharir	[33] [48] [50] [52] [59] [64] [66] [71] [73] [80] [89] [95] [153] [156] [172] [188]
93	Michiel H. M. Smid	[35] [39] [40] [42] [43] [47]
94	Gordon Smith	[137] [143] [149]
95	Jack Snoeyink	[65] [86] [88] [109]
96	Michael A. Soss	[148] [152] [159] [161] [167]
97	Diane L. Souvaine	[83] [113]
98	A. Frank van der Stappen	[79] [81] [90] [93] [101] [107] [119] [120] [124] [126] [128] [130] [133] [135] [137] [138] [139] [140] [142] [144] [150] [155] [157] [158] [162] [163] [164] [168] [178] [182] [183] [190] [195] [200] [201]
99	Ileana Streinu	[129] [134] [136] [151] [161]
100	Petr Svestka	[99] [106] [114] [121]
101	Johan W. H. Tangelder	[125]
102	Monique Teillaud	[80] [95]
103	Leen Torenvliet	[39] [40] [47]
104	Godfried T. Toussaint	[82] [117] [129] [134] [136] [141] [148] [151] [152] [161] [165] [221]
105	Jorge Urrutia	[83] [113]
106	Jan Vahrenhold	[153] [156]
107	Remco C. Veltkamp	[145] [147]
108	Joris S. M. Vergeest	[125]
109	Ingrid Vincent	[41]
110	Jules Vleugels	[94] [102] [111] [123] [124] [130] [133] [157] [168]
111	Herwin van Welbergen	[217]
112	Emo Welzl	[18] [19] [32]
113	Chantal Wentink	[98] [107] [138] [140]
114	Sue Whitesides	[129] [132] [134] [136] [151] [171] [179] [208]
115	Gordon T. Wilfong	[82] [108] [117] [122]
116	Gerhard J. Woeginger	[70]
117	Derick Wood	[23] [25]
118	Chee-Keng Yap (Chee Yap)	[36] [58]
119	Sidi Yu	[109]
120	Mike Tao Zhang	[149]
121	Tao Zhang	[143]
122	Binhai Zhu	[82] [117]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page