2008 | ||
---|---|---|
202 | 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 | |
201 | EE | Mark H. Overmars, Ioannis Karamouzas, Roland Geraerts: Flexible Path Planning Using Corridor Maps. ESA 2008: 1-12 |
200 | EE | 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 |
199 | EE | 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) |
198 | EE | Ioannis Karamouzas, Mark H. Overmars: Adding variation to path planning. Journal of Visualization and Computer Animation 19(3-4): 283-293 (2008) |
2007 | ||
197 | EE | Roland Geraerts, Mark H. Overmars: The Corridor Map Method: Real-Time High-Quality Path Planning. ICRA 2007: 1023-1028 |
196 | EE | Dennis Nieuwenhuisen, Jur P. van den Berg, Mark H. Overmars: Efficient path planning in changing environments. IROS 2007: 3295-3301 |
195 | EE | Jur P. van den Berg, Mark H. Overmars: Kinodynamic motion planning on roadmaps in dynamic environments. IROS 2007: 4253-4258 |
194 | EE | Mark de Berg, Dan Halperin, Mark H. Overmars: An intersection-sensitive algorithm for snap rounding. Comput. Geom. 36(3): 159-165 (2007) |
193 | EE | Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars: Pushing a Disk Using Compliance. IEEE Transactions on Robotics 23(3): 431-442 (2007) |
192 | EE | 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) |
191 | EE | 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) |
190 | EE | Roland Geraerts, Mark H. Overmars: Reachability-based analysis for Probabilistic Roadmap planners. Robotics and Autonomous Systems 55(11): 824-836 (2007) |
189 | EE | Dennis Nieuwenhuisen, Arno Kamphuis, Mark H. Overmars: High quality navigation in computer games. Sci. Comput. Program. 67(1): 91-104 (2007) |
2006 | ||
188 | Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars: Pushing using Compliance. ICRA 2006: 2010-2016 | |
187 | EE | Roland Geraerts, Mark H. Overmars: Creating High-quality Roadmaps for Motion Planning in Virtual Environments. IROS 2006: 4355-4361 |
186 | EE | Jur P. van den Berg, Mark H. Overmars: Computing Shortest Safe Path amidst Growing Discs in the Plane. Robot Navigation 2006 |
185 | EE | Mark H. Overmars: Scientific challenges ingame technology. VRST 2006: 1 |
184 | EE | Jur P. van den Berg, Mark H. Overmars: Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles. WAFR 2006: 103-118 |
183 | EE | Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars: An Effective Framework for Path Planning Amidst Movable Obstacles. WAFR 2006: 87-102 |
182 | EE | Roland Geraerts, Mark H. Overmars: Sampling and node adding in probabilistic roadmap planners. Robotics and Autonomous Systems 54(2): 165-173 (2006) |
181 | EE | Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir: Computing Maximally Separated Sets in the Plane. SIAM J. Comput. 36(3): 815-834 (2006) |
2005 | ||
180 | Roland Geraerts, Mark H. Overmars: Reachability Analysis of Sampling Based Planners. ICRA 2005: 404-410 | |
179 | 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) | |
178 | EE | 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) |
177 | EE | 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) |
176 | EE | 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 | ||
175 | EE | Roland Geraerts, Mark H. Overmars: Clearance based Path Optimization for Motion Planning. ICRA 2004: 2386-2392 |
174 | EE | Arno Kamphuis, Mark H. Overmars: Motion Planning for Coherent Groups of Entities. ICRA 2004: 3815-3822 |
173 | EE | Dennis Nieuwenhuisen, Mark H. Overmars: Motion Planning for Camera Movements. ICRA 2004: 3870-3876 |
172 | EE | Dennis Nieuwenhuisen, Mark H. Overmars: Useful Cycles in Probabilistic Roadmap Graphs. ICRA 2004: 446-452 |
171 | EE | 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 |
170 | EE | 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 |
169 | EE | 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 |
168 | EE | Mark H. Overmars: Teaching Computer Science through Game Design. IEEE Computer 37(4): 81-83 (2004) |
2003 | ||
167 | Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars: On R-trees with low query complexity. Comput. Geom. 24(3): 179-195 (2003) | |
166 | EE | 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) |
165 | EE | 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) |
164 | EE | Mark H. Overmars: Finding Sets of Points without Empty Convex 6-Gons. Discrete & Computational Geometry 29(1): 153-158 (2003) |
2002 | ||
163 | EE | 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 |
162 | EE | 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 |
161 | Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen: Sensorless Orientation of 3D Polyhedral Parts. ICRA 2002: 2016-2021 | |
160 | Jae-Sook Cheong, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen: Fixturing Hinged Polygons. ICRA 2002: 876-881 | |
159 | EE | 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 |
158 | EE | Mark H. Overmars: Recent Developments in Motion Planning. International Conference on Computational Science (3) 2002: 3-13 |
157 | EE | Michael A. Soss, Jeff Erickson, Mark H. Overmars: Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible CoRR cs.CG/0204042: (2002) |
156 | Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen: Orienting polyhedral parts by pushing. Comput. Geom. 21(1-2): 21-38 (2002) | |
155 | 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) | |
154 | 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 | ||
153 | Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen: Orienting Parts by Inside-out Pulling. ICRA 2001: 1053-1058 | |
152 | Danielle Sent, Mark H. Overmars: Motion Planning in Environments with Dangerzones. ICRA 2001: 1488-1493 | |
151 | EE | 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 |
150 | 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) | |
149 | EE | 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) |
148 | EE | 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) |
2000 | ||
147 | EE | Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint: Reconfiguring Convex Polygons. CCCG 2000 |
146 | EE | Michiel Hagedoorn, Mark H. Overmars, Remco C. Veltkamp: A New Visibility Partition for Affine Pattern Matching. DGCI 2000: 358-370 |
145 | Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars: On R-trees with Low Stabbing Number. ESA 2000: 167-178 | |
144 | Michiel Hagedoorn, Mark H. Overmars, Remco C. Veltkamp: A Robust Affine Invariant Similarity Measure Based on Visibility. EWCG 2000: 112-116 | |
143 | Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen: Orienting Polyhedral Parts by Pushing. EWCG 2000: 136-139 | |
142 | 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 | |
141 | EE | 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 |
140 | EE | 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) |
139 | EE | 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 | ||
138 | Valérie Boor, Mark H. Overmars, A. Frank van der Stappen: The Gaussian Sampling Strategy for Probabilistic Roadmap Planners. ICRA 1999: 1018-1023 | |
137 | A. Frank van der Stappen, Chantal Wentink, Mark H. Overmars: Computing Form-Closure Configurations. ICRA 1999: 1837-1842 | |
136 | 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 | |
135 | EE | 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 |
134 | EE | 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 |
133 | EE | 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 | ||
132 | 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 | |
131 | EE | 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 |
130 | EE | Mark H. Overmars: Geometric Algorithms for Robotic Manipulation. ICALP 1998: 116-117 |
129 | EE | Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels: Models and Motion Planning. SWAT 1998: 83-94 |
128 | EE | 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) |
127 | 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) | |
126 | Dan Halperin, Mark H. Overmars: Spheres, molecules, and hidden surface removal. Comput. Geom. 11(2): 83-102 (1998) | |
125 | 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) | |
124 | EE | 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) |
123 | EE | 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) |
122 | Jules Vleugels, Mark H. Overmars: Approximating Voronoi Diagrams of Convex Sites in any Dimension. Int. J. Comput. Geometry Appl. 8(2): 201-222 (1998) | |
121 | Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong: Computing the Angularity Tolerance. Int. J. Comput. Geometry Appl. 8(4): 467- (1998) | |
120 | EE | Petr Svestka, Mark H. Overmars: Coordinated path planning for multiple robots. Robotics and Autonomous Systems 23(3): 125-152 (1998) |
1997 | ||
119 | EE | 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 |
118 | Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen: Dynamic Motion Planning in Low Obstacle Density Environments. WADS 1997: 3-16 | |
117 | Mark H. Overmars, Nicola Santoro: Improved Bounds for Electing a Leader in a Synchronous Ring. Algorithmica 18(2): 246-262 (1997) | |
116 | 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) | |
115 | EE | Mark de Berg, Marko de Groot, Mark H. Overmars: Perfect Binary Space Partitions. Comput. Geom. 7: 81-91 (1997) |
114 | Mark de Berg, Marko de Groot, Mark H. Overmars: New Results on Binary Space Partitions in the Plane. Comput. Geom. 8: 317-333 (1997) | |
113 | Petr Svestka, Mark H. Overmars: Motion Planning for Carlike Robots Using a Probabilistic Learning Approach. I. J. Robotic Res. 16(2): 119-143 (1997) | |
112 | 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) | |
111 | 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) | |
110 | EE | 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) |
109 | 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 | ||
108 | 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 | |
107 | Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong: Computing the Angularity Tolerance. CCCG 1996: 331-336 | |
106 | Chantal Wentink, A. Frank van der Stappen, Mark H. Overmars: Fixture Design with Edge-Fixels. Intelligent Robots 1996: 269-286 | |
105 | Mark H. Overmars, Petr Svestka: Probabilistic Approaches to Motion Planning. SOFSEM 1996: 95-112 | |
104 | EE | 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 |
103 | Mark H. Overmars: Designing the Computational Geometry Algorithms Library CGAL. WACG 1996: 53-58 | |
102 | Leonidas J. Guibas, Mark H. Overmars, Jean-Marc Robert: The Exact Fitting Problem in Higher Dimensions. Comput. Geom. 6: 215-230 (1996) | |
101 | Jules Vleugels, Vincenzo Ferrucci, Mark H. Overmars, Anil S. Rao: Hunting Voronoi Vertices. Comput. Geom. 6: 329-354 (1996) | |
100 | Mark H. Overmars, A. Frank van der Stappen: Range Searching and Point Location among Fat Objects. J. Algorithms 21(3): 629-656 (1996) | |
1995 | ||
99 | 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- | |
98 | Petr Svestka, Mark H. Overmars: Coordinated Motion Planning for Multiple Car-Like Robots Using Probabilistic Roadmaps. ICRA 1995: 1631-1636 | |
97 | EE | Mark H. Overmars, Anil S. Rao, Otfried Schwarzkopf, Chantal Wentink: Immobilizing Polygons against a Wall. Symposium on Computational Geometry 1995: 29-38 |
96 | EE | 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 |
95 | Anka Gajentaan, Mark H. Overmars: On a Class of O(n2) Problems in Computational Geometry. Comput. Geom. 5: 165-185 (1995) | |
94 | EE | 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 | ||
93 | Vincenzo Ferrucci, Mark H. Overmars, Anil S. Rao, Jules Vleugels: Hunting Voronoi Vertices in Non-Polygonal Domains. CCCG 1994: 45-50 | |
92 | Mark H. Overmars, A. Frank van der Stappen: Range Searching and Point Location among Fat Objects. ESA 1994: 240-253 | |
91 | Mark de Berg, Marko de Groot, Mark H. Overmars: New Results on Binary Space Partitions in the Plane (Extended Abstract). SWAT 1994: 61-72 | |
90 | EE | Dan Halperin, Mark H. Overmars: Spheres, Molecules, and Hidden Surface Removal. Symposium on Computational Geometry 1994: 113-122 |
89 | EE | A. Frank van der Stappen, Mark H. Overmars: Motion Planning Amidst Fat Obstacles (Extended Abstract). Symposium on Computational Geometry 1994: 31-40 |
88 | Mark H. Overmars, Micha Sharir: An Improved Technique for Output-Sensitive Hidden Surface Removal. Algorithmica 11(5): 469-484 (1994) | |
87 | 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) | |
86 | Marc J. van Kreveld, Mark H. Overmars: Concatenable Structures for Decomposable Problems Inf. Comput. 110(1): 130-148 (1994) | |
85 | 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) | |
84 | Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf: Computing and Verifying Depth Orders. SIAM J. Comput. 23(2): 437-446 (1994) | |
1993 | ||
83 | Mark de Berg, Marko de Groot, Mark H. Overmars: Perfect Binary Space Partitions. CCCG 1993: 109-114 | |
82 | Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia: The Floodlight Problem. CCCG 1993: 399-404 | |
81 | 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 | |
80 | A. Frank van der Stappen, Dan Halperin, Mark H. Overmars: Efficient Algorithms for Exact Motion Planning Amidst Fat Obstacles. ICRA (1) 1993: 297-304 | |
79 | 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 | |
78 | 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) | |
77 | EE | 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) |
76 | Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars: Output-Sensitive Methods for Rectilinear Hidden Surface Removal Inf. Comput. 107(1): 1-24 (1993) | |
75 | EE | Marc J. van Kreveld, Mark H. Overmars: Union-Copy Structures and Dynamic Segment Trees. J. ACM 40(3): 635-652 (1993) |
74 | Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars: Intersection Queries in Curved Objects. J. Algorithms 15(2): 229-266 (1993) | |
1992 | ||
73 | EE | Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf: Computing and Verifying Depth Orders. Symposium on Computational Geometry 1992: 138-145 |
72 | EE | Micha Sharir, Mark H. Overmars: A Simple Output-Sensitive Algorithm for Hidden Surface Removal. ACM Trans. Graph. 11(1): 1-11 (1992) |
71 | Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal: Intersection Queries in Sets of Disks. BIT 32(2): 268-279 (1992) | |
70 | Matthew J. Katz, Mark H. Overmars, Micha Sharir: Efficient Hidden Surface Removal for Objects with Small Union Size. Comput. Geom. 2: 223-234 (1992) | |
69 | David Eppstein, Mark H. Overmars, Günter Rote, Gerhard J. Woeginger: Finding Minimum Area k-gons. Discrete & Computational Geometry 7: 45-58 (1992) | |
68 | Mark H. Overmars: Point Location in Fat Subdivisions. Inf. Process. Lett. 44(5): 261-265 (1992) | |
67 | 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) | |
66 | Mark de Berg, Svante Carlsson, Mark H. Overmars: A General Approach to Dominance in the Plane. J. Algorithms 13(2): 274-296 (1992) | |
65 | Dan Halperin, Mark H. Overmars, Micha Sharir: Efficient Motion Planning for an L-Shaped Object. SIAM J. Comput. 21(1): 1-23 (1992) | |
1991 | ||
64 | EE | 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 |
63 | EE | 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 |
62 | EE | Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars: Intersection Queries for Curved Objects (Extended Abstract). Symposium on Computational Geometry 1991: 41-50 |
61 | Marc J. van Kreveld, Mark H. Overmars: Divided k-d Trees. Algorithmica 6(6): 840-858 (1991) | |
60 | Haijo Schipper, Mark H. Overmars: Dynamic Partition Trees. BIT 31(3): 421-436 (1991) | |
59 | Mark de Berg, Mark H. Overmars: Hidden Surface Removal for C-oriented Polyhedra. Comput. Geom. 1: 247-268 (1991) | |
58 | Mark H. Overmars, Micha Sharir: Merging Visibility Maps. Comput. Geom. 1: 35-49 (1991) | |
57 | Mark H. Overmars, Chee-Keng Yap: New Upper Bounds in Klee's Measure Problem. SIAM J. Comput. 20(6): 1034-1045 (1991) | |
1990 | ||
56 | Mark de Berg, Mark H. Overmars: Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract) FOCS 1990: 252-261 | |
55 | 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 | |
54 | 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 | |
53 | Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal: Intersection Queries in Sets of Disks. SWAT 1990: 393-403 | |
52 | Haijo Schipper, Mark H. Overmars: Dynamic Partition Trees. SWAT 1990: 404-417 | |
51 | EE | Mark H. Overmars, Micha Sharir: Merging Visibility Maps. Symposium on Computational Geometry 1990: 168-176 |
50 | David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars: Searching for Empty Convex Polygons. Algorithmica 5(4): 561-571 (1990) | |
49 | Mark H. Overmars, Haijo Schipper, Micha Sharir: Storing Line Segments in Partition Trees. BIT 30(3): 385-403 (1990) | |
1989 | ||
48 | Mark H. Overmars: Computational Geometry and its Application to Computer Graphics. Advances in Computer Graphics 1989: 75-107 | |
47 | Mark H. Overmars, Micha Sharir: Output-Sensitive Hidden Surface Removal FOCS 1989: 598-603 | |
46 | Michiel H. M. Smid, Mark H. Overmars, Leen Torenvliet, Peter van Emde Boas: Multiple Representations of Dynamic Data Structures. IFIP Congress 1989: 437-442 | |
45 | Mark H. Overmars, Nicola Santoro: TIME vs BITS. STACS 1989: 282-293 | |
44 | Marc J. van Kreveld, Mark H. Overmars: Concatenable Segment Trees (Extended Abstract). STACS 1989: 493-504 | |
43 | EE | Dan Halperin, Mark H. Overmars: Efficient Motion Planning for an L-Shaped Object. Symposium on Computational Geometry 1989: 156-166 |
42 | 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) | |
41 | Michiel H. M. Smid, Mark H. Overmars: Maintaining Range Trees in Secondary Memory. Part II: Lower Bounds. Acta Inf. 27(5): 453-480 (1989) | |
40 | Mark H. Overmars, Bertha Scholten, Ingrid Vincent: Sets without emtpy convex 6-gons. Bulletin of the EATCS 37: 160-167 (1989) | |
39 | 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) | |
38 | 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) | |
37 | Patrick Lentfert, Mark H. Overmars: Data Structures in a Real-Time Environment. Inf. Process. Lett. 31(3): 151-155 (1989) | |
36 | EE | Patrick Lentfert, Mark H. Overmars: Data structures in a real-time environment. Inf. Process. Lett. 32(3): 151-155 (1989) |
35 | 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 | ||
34 | Mark H. Overmars, Chee-Keng Yap: New upper bounds in Klee's measure problem (extended abstract) FOCS 1988: 550-556 | |
33 | Mark H. Overmars, Michiel H. M. Smid: Maintaining Range Trees in Secondary Memory (Extended Abstract). STACS 1988: 38-51 | |
32 | Mark H. Overmars: Connectability Problems. SWAT 1988: 105-112 | |
31 | Leonidas J. Guibas, Mark H. Overmars, Micha Sharir: Intersecting Line Segments, Ray Shooting, and Other Applications of Geometric Partitioning Techniques. SWAT 1988: 64-73 | |
30 | EE | Mark H. Overmars, Emo Welzl: New Methods for Computing Visibility Graphs. Symposium on Computational Geometry 1988: 164-171 |
29 | EE | David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars: Searching for Empty Convex Polygons. Symposium on Computational Geometry 1988: 224-228 |
28 | Mark de Berg, Mark H. Overmars: Dominance in the Presence of Obstracles. WG 1988: 190-201 | |
27 | Christos Levcopoulos, Mark H. Overmars: A Balanced Search Tree with O (1) Worst-case Update Time. Acta Inf. 26(3): 269-277 (1988) | |
26 | Rolf G. Karlsson, Mark H. Overmars: Scanline Algorithms on a Grid. BIT 28(2): 227-241 (1988) | |
25 | 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) | |
24 | Mark H. Overmars: Efficient Data Structures for Range Searching on a Grid. J. Algorithms 9(2): 254-275 (1988) | |
23 | Mark H. Overmars, Derick Wood: On Rectangular Visibility. J. Algorithms 9(3): 372-390 (1988) | |
1987 | ||
22 | Mark H. Overmars: New Algorithms for Computer Graphics. Advances in Computer Graphics Hardware 1987: 3-19 | |
21 | EE | J. Ian Munro, Mark H. Overmars, Derick Wood: Variations on Visibility. Symposium on Computational Geometry 1987: 291-299 |
20 | Herbert Edelsbrunner, Mark H. Overmars: Zooming by Repeated Range Detection. Inf. Process. Lett. 24(6): 413-417 (1987) | |
1985 | ||
19 | Hans-Peter Kriegel, Rita Mannss, Mark H. Overmars: The Inverted File Tree Machine: Efficient Multi-Key Retrieval for VLSI. FODO 1985: 279-291 | |
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 | EE | 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) |