Mark de Berg

Mark de Berg, Atlas F. Cook IV, Joachim Gudmundsson: Fast Fréchet queries. Comput. Geom. 46(6): 747-755 (2013)

Mark de Berg: Guest Editorial. Algorithmica 63(4): 731-732 (2012)

Mark de Berg, Dirk H. P. Gerrits: Approximation algorithms for free-label maximization. Comput. Geom. 45(4): 153-168 (2012)

Boris Aronov, Mark de Berg: Unions of Fat Convex Polytopes Have Short Skeletons. Discrete & Computational Geometry 48(1): 53-64 (2012)

Mark de Berg, Amirali Khosravi: Optimal Binary Space Partitions for Segments in the Plane. Int. J. Comput. Geometry Appl. 22(3): 187-206 (2012)

Mark de Berg, Marcel Roeloffzen, Bettina Speckmann: Kinetic Convex Hulls, Delaunay Triangulations and Connectivity Structures in the Black-Box Model. JoCG 3(1): 222-249 (2012)

Mark de Berg, Marcel Roeloffzen, Bettina Speckmann: Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes. ESA 2012: 383-394

Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg, Hai Yu: Out-of-Order Event Processing in Kinetic Data Structures. Algorithmica 60(2): 250-273 (2011)

Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid: Geometric Spanners for Weighted Point Sets. Algorithmica 61(1): 207-225 (2011)

Mohammad Ali Abam, Mark de Berg: Kinetic Spanners in ℝ^d. Discrete & Computational Geometry 45(4): 723-736 (2011)

Mark de Berg, Marcel Roeloffzen, Bettina Speckmann: Kinetic convex hulls and delaunay triangulations in the black-box model. Symposium on Computational Geometry 2011: 244-253

Mohammad Ali Abam, Boris Aronov, Mark de Berg, Amirali Khosravi: Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons. Symposium on Computational Geometry 2011: 407-416

Mark de Berg, Constantinos P. Tsirogiannis: Exact and approximate computations of watersheds on triangulated terrains. GIS 2011: 74-83

Mark de Berg, Wouter Meulemans, Bettina Speckmann: Delineating imprecise regions via shortest-path graphs. GIS 2011: 271-280

Mark de Berg, Atlas F. Cook IV, Joachim Gudmundsson: Fast Fréchet Queries. ISAAC 2011: 240-249

Mark de Berg, Bettina Speckmann, Vincent van der Weele: Treemaps with Bounded Aspect Ratio. ISAAC 2011: 260-270

Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis: Implicit Flow Routing on Terrains with Applications to Surface Networks and Drainage Structures. SODA 2011: 285-296

Mark de Berg, Atlas F. Cook: Go with the Flow: The Direction-Based Fréchet Distance of Polygonal Curves. TAPAS 2011: 81-91

Mohammad Ali Abam, Mark de Berg, Amirali Khosravi: Piecewise-Linear Approximations of Uncertain Functions. WADS 2011: 1-12

Mark de Berg, Amirali Khosravi, Sander Verdonschot, Vincent van der Weele: On Rectilinear Partitions with Minimum Stabbing Number. WADS 2011: 302-313

Mark de Berg, Chris Gray: Decompositions and boundary coverings of non-convex fat polyhedra. Comput. Geom. 43(2): 73-83 (2010)

Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson: A simple and efficient kinetic spanner. Comput. Geom. 43(3): 251-256 (2010)

Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma: The complexity of flow on fat terrains and its i/o-efficient computation. Comput. Geom. 43(4): 331-356 (2010)

Mark de Berg, Chris Gray: Computing the visibility map of fat objects. Comput. Geom. 43(4): 410-418 (2010)

Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma: Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions. Comput. Geom. 43(5): 493-513 (2010)

Mohammad Ali Abam, Mark de Berg, Peter Hachenberger, Alireza Zarei: Streaming Algorithms for Line Simplification. Discrete & Computational Geometry 43(3): 497-515 (2010)

Mark de Berg, Elena Mumford, Bettina Speckmann: Optimal BSPs and Rectilinear Cartograms. Int. J. Comput. Geometry Appl. 20(2): 203-222 (2010)

Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis: Visibility Maps of Realistic Terrains have Linear Smoothed Complexity. JoCG 1(1): 57-71 (2010)

Farnaz Sheikhi, Mark de Berg, Ali Mohades, Mansoor Davoodi Monfared: Finding monochromatic l-shapes in bichromatic point sets. CCCG 2010: 269-272

Mark de Berg, Amirali Khosravi: Optimal Binary Space Partitions in the Plane. COCOON 2010: 216-225

Mark de Berg: Better bounds on the union complexity of locally fat objects. Symposium on Computational Geometry 2010: 39-47

Mark de Berg, Dirk H. P. Gerrits: Computing push plans for disk-shaped robots. ICRA 2010: 4487-4492

Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff, Mark de Berg: The Traveling Salesman Problem under Squared Euclidean Distances. STACS 2010: 239-250

Mark de Berg, Dirk H. P. Gerrits: Approximation Algorithms for Free-Label Maximization. SWAT 2010: 297-308

Jack Snoeyink, Mark de Berg, Joseph S. B. Mitchell, Günter Rote, Monique Teillaud (Eds.): Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010. ACM 2010, isbn 978-1-4503-0016-2

Mark de Berg, Ulrich Meyer (Eds.): Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I. Lecture Notes in Computer Science 6346, Springer 2010, isbn 978-3-642-15774-5

Mark de Berg, Ulrich Meyer (Eds.): Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II. Lecture Notes in Computer Science 6347, Springer 2010, isbn 978-3-642-15780-6

Mark de Berg, Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff: The Traveling Salesman Problem Under Squared Euclidean Distances. CoRR abs/1001.0236 (2010)

Mark de Berg, Krzysztof Onak, Anastasios Sidiropoulos: Fat Polygonal Partitions with Applications to Visualization and Embeddings. CoRR abs/1009.1866 (2010)

Mark de Berg, Bettina Speckmann, Vincent van der Weele: Treemaps with Bounded Aspect Ratio. CoRR abs/1012.1749 (2010)

Lars Arge, Mark de Berg, Herman J. Haverkort: Cache-Oblivious R-Trees. Algorithmica 53(1): 50-68 (2009)

Mohammad Ali Abam, Mark de Berg, Sheung-Hung Poon, Bettina Speckmann: Kinetic Collision Detection for Convex Fat Objects. Algorithmica 53(4): 457-473 (2009)

Mark de Berg, Herman J. Haverkort, Micha Streppel: Efficient c-oriented range searching with DOP-trees. Comput. Geom. 42(3): 250-267 (2009)

Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson: Region-Fault Tolerant Geometric Spanners. Discrete & Computational Geometry 41(4): 556-582 (2009)

Mark de Berg, Elena Mumford, Bettina Speckmann: On rectilinear duals for vertex-weighted plane graphs. Discrete Mathematics 309(7): 1794-1812 (2009)

Sergio Cabello, Mark de Berg, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp: Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. Int. J. Comput. Geometry Appl. 19(6): 533-556 (2009)

Mark de Berg, Sergio Cabello, Sariel Har-Peled: Covering Many or Few Points with Unit Disks. Theory Comput. Syst. 45(3): 446-469 (2009)

Mohammad Ali Abam, Mark de Berg, Bettina Speckmann: Kinetic kd-Trees and Longest-Side kd-Trees. SIAM J. Comput. 39(4): 1219-1232 (2009)

Mohammad Ali Abam, Mark de Berg: Kinetic spanners in R^d. Symposium on Computational Geometry 2009: 43-50

Mark de Berg, Fred van Nijnatten, Bettina Speckmann, Kevin Verbeek: Rectangular cartograms: the game. Symposium on Computational Geometry 2009: 96-97

Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis: Visibility maps of realistic terrains have linear smoothed complexity. Symposium on Computational Geometry 2009: 163-168

Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid: Geometric Spanners for Weighted Point Sets. ESA 2009: 190-202

Mark de Berg, Peter Hachenberger: Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy. SEA 2009: 63-75

Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron: Sparse geometric graphs with small dilation. Comput. Geom. 40(3): 207-219 (2008)

Boris Aronov, Mark de Berg, Chris Gray: Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. Comput. Geom. 41(1-2): 68-76 (2008)

Mark de Berg: Improved Bounds on the Union Complexity of Fat Objects. Discrete & Computational Geometry 40(1): 127-140 (2008)

Mark de Berg, Shripad Thite: Cache-oblivious selection in sorted X. Inf. Process. Lett. 109(2): 87-92 (2008)

Mark de Berg, Chris Gray: Vertical Ray Shooting and Computing Depth Orders for Fat Objects. SIAM J. Comput. 38(1): 257-275 (2008)

Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi: The priority R-tree: A practically efficient and worst-case optimal R-tree. ACM Transactions on Algorithms 4(1) (2008)

Mohammad Ali Abam, Mark de Berg, Sheung-Hung Poon: Fault-Tolerant Conflict-Free Coloring. CCCG 2008

Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson: A simple and efficient kinetic spanner. Symposium on Computational Geometry 2008: 306-310

Boris Aronov, Mark de Berg, Shripad Thite: The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains. ESA 2008: 100-111

Mark de Berg, Chris Gray: Decompositions and Boundary Coverings of Non-convex Fat Polyhedra. ESA 2008: 173-184

Patrick Laube, Mark de Berg, Marc J. van Kreveld: Spatial Support and Spatial Confidence for Spatial Association Rules. SDH 2008: 575-593

Boris Aronov, Mark de Berg, Chris Gray, Elena Mumford: Cutting cycles of rods in space: hardness and approximation. SODA 2008: 1241-1248

Mark de Berg, Shripad Thite: Cache-Oblivious Selection in Sorted X+Y Matrices. CoRR abs/0804.0936 (2008)

Mark de Berg, Joachim Gudmundsson, René van Oostrum, Bettina Speckmann: Editorial. Comput. Geom. 36(1): 1 (2007)

Mark de Berg, Dan Halperin, Mark H. Overmars: An intersection-sensitive algorithm for snap rounding. Comput. Geom. 36(3): 159-165 (2007)

Mohammad Ali Abam, Mark de Berg: Kinetic sorting and kinetic convex hulls. Comput. Geom. 37(1): 16-26 (2007)

Mohammad Ali Abam, Mark de Berg, Peter Hachenberger, Alireza Zarei: Streaming algorithms for line simplification. Symposium on Computational Geometry 2007: 175-183

Mohammad Ali Abam, Mark de Berg, Bettina Speckmann: Kinetic KD-trees and longest-side KD-trees. Symposium on Computational Geometry 2007: 364-372

Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma: I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions. ISAAC 2007: 500-511

Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson: Region-fault tolerant geometric spanners. SODA 2007: 1-10

Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma: I/O-Efficient Flow Modeling on Fat Terrains. WADS 2007: 239-250

Mark de Berg, Chris Gray: Computing the Visibility Map of Fat Objects. WADS 2007: 251-262

Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron: Sparse geometric graphs with small dilation. CoRR abs/cs/0702080 (2007)

Mark de Berg, Micha Streppel: Approximate range searching using binary space partitions. Comput. Geom. 33(3): 139-151 (2006)

Boris Aronov, Mark de Berg, Chris Gray: Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. Symposium on Computational Geometry 2006: 88-94

Mohammad Ali Abam, Mark de Berg, Sheung-Hung Poon, Bettina Speckmann: Kinetic Collision Detection for Convex Fat Objects. ESA 2006: 4-15

Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg, Hai Yu: Out-of-Order Event Processing in Kinetic Data Structures. ESA 2006: 624-635

Mark de Berg, Elena Mumford, Bettina Speckmann: Optimal BSPs and rectilinear cartograms. GIS 2006: 19-26

Mark de Berg, Chris Gray: Vertical ray shooting and computing depth orders for fat objects. SODA 2006: 494-503

Mark de Berg, Sergio Cabello, Sariel Har-Peled: Covering Many or Few Points with Unit Disks. WAOA 2006: 55-68

Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff: Optimal spanners for axis-aligned rectangles. Comput. Geom. 30(1): 59-77 (2005)

Sergio Cabello, Mark de Berg, Marc J. van Kreveld: Schematization of networks. Comput. Geom. 30(3): 223-228 (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): 22-36 (2005)

Pankaj K. Agarwal, Mark de Berg, Jie Gao, Leonidas J. Guibas, Sariel Har-Peled: Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points. CCCG 2005: 43-46

Lars Arge, Mark de Berg, Herman J. Haverkort: Cache-oblivious r-trees. Symposium on Computational Geometry 2005: 170-179

Mohammad Ali Abam, Mark de Berg: Kinetic sorting and kinetic convex hulls. Symposium on Computational Geometry 2005: 190-197

Mark de Berg: Vertical ray shooting for fat objects. Symposium on Computational Geometry 2005: 288-295

Mark de Berg, Herman J. Haverkort, Micha Streppel: Efficient c-Oriented Range Searching with DOP-Trees. ESA 2005: 508-519

Mark de Berg: Improved Bounds on the Union Complexity of Fat Objects. FSTTCS 2005: 116-127

Mark de Berg, Elena Mumford, Bettina Speckmann: On Rectilinear Duals for Vertex-Weighted Plane Graphs. Graph Drawing 2005: 61-72

Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron: Sparse Geometric Graphs with Small Dilation. ISAAC 2005: 50-59

Mark de Berg, Xavier Goaoc, A. Frank van der Stappen: A Polynomial-time Algorithm to Design Push Plans for Sensorless Parts Sorting. Robotics: Science and Systems 2005: 89-96

Mohammad Ali Abam, Mark de Berg: Lower bounds for kinetic sorting. EuroCG 2005: 171-174

Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat Morin: On simplifying dot maps. Comput. Geom. 27(1): 43-62 (2004)

Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson: Box-trees for collision checking in industrial installations. Comput. Geom. 28(2-3): 113-135 (2004)

Mark de Berg: Guest Editor's Foreword. Discrete & Computational Geometry 32(2): 165-166 (2004)

Steven van Dijk, Dirk Thierens, Mark de Berg: On the Design and Analysis of Competent Selecto-recombinative GAs. Evolutionary Computation 12(2): 243-267 (2004)

Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi: The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. Cache-Oblivious and Cache-Aware Algorithms 2004

Mark de Berg, Micha Streppel: Approximate Range Searching Using Binary Space Partitions. FSTTCS 2004: 110-121

Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi: The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree. SIGMOD Conference 2004: 347-358

Mark de Berg, Sergio Cabello, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp: Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion. SWAT 2004: 138-149

Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars: On R-trees with low query complexity. Comput. Geom. 24(3): 179-195 (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): 99-117 (2003)

Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki: Spanning Trees Crossing Few Barriers. Discrete & Computational Geometry 30(4): 591-606 (2003)

Mark de Berg: Kinetic Dictionaries: How to Shoot a Moving Target. ESA 2003: 172-183

Mark de Berg, Herman J. Haverkort: Significant-Presence Range Queries in Categorical Data. WADS 2003: 462-473

Mark de Berg, A. Frank van der Stappen, Jules Vleugels, Matthew J. Katz: Realistic Input Models for Geometric Algorithms. Algorithmica 34(1): 81-97 (2002)

Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf: Separating an object from its cast. Computer-Aided Design 34(8): 547-559 (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): 53-68 (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): 195-207 (2002)

Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort: Box-Trees and R-Trees with Near-Optimal Query Time. Discrete & Computational Geometry 28(3): 291-312 (2002)

Steven van Dijk, Dirk Thierens, Mark de Berg: Using Genetic Algorithms for Solving Hard Problems in GIS. GeoInformatica 6(4): 381-413 (2002)

Mark de Berg, Stefan Schirra: Guest Editor's Foreword. Int. J. Comput. Geometry Appl. 12(1-2): 1-2 (2002)

Mark de Berg, A. Frank van der Stappen: On the fatness of Minkowski sums. Inf. Process. Lett. 81(5): 259-264 (2002)

Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson: Box-trees for collision checking in industrial installations. Symposium on Computational Geometry 2002: 53-62

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

Sergio Cabello, Mark de Berg, Steven van Dijk, Marc J. van Kreveld, Tycho Strijk: Schematization of road networks. Symposium on Computational Geometry 2001: 33-39

Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort: Box-trees and R-trees with near-optimal query time. Symposium on Computational Geometry 2001: 124-133

Mark de Berg, João Comba, Leonidas J. Guibas: A segment-tree based kinetic BSP. Symposium on Computational Geometry 2001: 134-140

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

Mark de Berg: Linear Size Binary Space Partitions for Uncluttered Scenes. Algorithmica 28(3): 353-366 (2000)

Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger: Lower Bounds for Kinetic Planar Subdivisions. Discrete & Computational Geometry 24(4): 721-733 (2000)

Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars: On R-trees with Low Stabbing Number. ESA 2000: 167-178

Steven van Dijk, Dirk Thierens, Mark de Berg: Scalability and Efficiency of Genetic Algorithms for Geometrical Applications. PPSN 2000: 683-692

Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels: Motion Planning for Multiple Robots. Discrete & Computational Geometry 22(4): 505-525 (1999)

Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki: Spanning Trees Crossing Few Barriers. Symposium on Computational Geometry 1999: 41-48

Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger: Lower Bounds for Kinetic Planar Subdivisions. Symposium on Computational Geometry 1999: 247-254

Steven van Dijk, Dirk Thierens, Mark de Berg: On The Design of Genetic Algorithms for Geographical Applications. GECCO 1999: 188-195

Paolo Ferragina, S. Muthukrishnan, Mark de Berg: Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems. STOC 1999: 483-491

Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong: Computing constrained minimum-width annuli of point sets. Computer-Aided Design 30(4): 267-275 (1998)

Mark de Berg, Hazel Everett, Leonidas J. Guibas: The union of moving polygonal pseudodiscs - Combinatorial bounds and applications. Comput. Geom. 11(2): 69-81 (1998)

Mark de Berg, Katrin Dobrindt: On Levels of Detail in Terrains. Graphical Models and Image Processing 60(1): 1-12 (1998)

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)

Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong: Computing the Angularity Tolerance. Int. J. Comput. Geometry Appl. 8(4): 467-482 (1998)

Mark de Berg, Otfried Cheong, Olivier Devillers, Marc J. van Kreveld, Monique Teillaud: Computing the Maximum Overlap of Two Convex Polygons under Translations. Theory Comput. Syst. 31(5): 613-628 (1998)

Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf: Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. SIAM J. Comput. 27(3): 654-667 (1998)

Mark de Berg, Prosenjit Bose, David Bremner, William S. Evans, Lata Narayanan: Recovering lines with fixed linear probes. CCCG 1998

Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels: Motion Planning for Multiple Robots. Symposium on Computational Geometry 1998: 374-382

Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels: Models and Motion Planning. SWAT 1998: 83-94

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

Mark de Berg, Marc J. van Kreveld: Trekking in the Alps Without Freezing or Getting Tired. Algorithmica 18(3): 306-323 (1997)

Mark de Berg: Trends and Developments in Computational Geometry. Comput. Graph. Forum 16(1): 3-30 (1997)

Mark de Berg, Marko de Groot, Mark H. Overmars: Perfect Binary Space Partitions. Comput. Geom. 7: 81-91 (1997)

Mark de Berg, Marko de Groot, Mark H. Overmars: New Results on Binary Space Partitions in the Plane. Comput. Geom. 8: 317-333 (1997)

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)

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)

Mark de Berg, Olivier Devillers, Katrin Dobrindt, Otfried Schwarzkopf: Computing a Single Cell in the Overlay of Two Simple Polygons. Inf. Process. Lett. 63(4): 215-219 (1997)

Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf: Separating an Object from its Cast. Symposium on Computational Geometry 1997: 221-230

Mark de Berg, Matthew J. Katz, A. Frank van der Stappen, Jules Vleugels: Realistic Input Models for Geometric Algorithms. Symposium on Computational Geometry 1997: 294-303

Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong: Computing Constrained Minimum-Width Annuli of Point Sets. WADS 1997: 392-401

Mark de Berg: Computing Half-plane and Strip Discrepancy of Planar Point Sets. Comput. Geom. 6: 69-83 (1996)

Mark de Berg, Marc J. van Kreveld, Otfried Schwarzkopf, Jack Snoeyink: Point Location in Zones of K-flats in Arrangements. Comput. Geom. 6: 131-143 (1996)

Mark de Berg, Leonidas J. Guibas, Dan Halperin: Vertical Decompositions for Triangles in 3-Space. Discrete & Computational Geometry 15(1): 35-61 (1996)

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

Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong: Computing the Angularity Tolerance. CCCG 1996: 331-336

Mark de Berg: Visualization of TINs. Algorithmic Foundations of Geographic Information Systems 1996: 79-97

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

Mark de Berg, Olivier Devillers, Marc J. van Kreveld, Otfried Schwarzkopf, Monique Teillaud: Computing the Maximum Overlap of Two Convex Polygons Under Translations. ISAAC 1996: 126-135

Pankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir: Efficient Generation of k-Directional Assembly Sequences. SODA 1996: 122-131

Mark de Berg: Generalized Hidden Surface Removal. Comput. Geom. 5: 249-276 (1995)

Mark de Berg, Jirí Matousek, Otfried Schwarzkopf: Piecewise Linear Paths Among Convex Obstacles. Discrete & Computational Geometry 14(1): 9-29 (1995)

Mark de Berg, Katrin Dobrindt, Otfried Schwarzkopf: On Lazy Randomized Incremental Construction. Discrete & Computational Geometry 14(3): 261-286 (1995)

Mark de Berg, Hazel Everett, Hubert Wagener: Translation queries for sets of polygons. Int. J. Comput. Geometry Appl. 5(3): 221-242 (1995)

Mark de Berg, Otfried Schwarzkopf: Cuttings and applications. Int. J. Comput. Geometry Appl. 5(4): 343-355 (1995)

Mark de Berg, Marc J. van Kreveld, Jack Snoeyink: Two- and Three-Dimensional Point Location in Rectangular Subdivisions. J. Algorithms 18(2): 256-277 (1995)

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)

Mark de Berg, Katrin Dobrindt: On Levels of Detail in Terrains. Symposium on Computational Geometry 1995: C26-C27

Mark de Berg: Linear Size Binary Space Partitions for Fat Objects. ESA 1995: 252-263

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-

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)

Mark de Berg, Marc J. van Kreveld: Rectilinear Decompositions with Low Stabbing Number. Inf. Process. Lett. 52(4): 215-221 (1994)

Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf: Computing and Verifying Depth Orders. SIAM J. Comput. 23(2): 437-446 (1994)

Mark de Berg, Leonidas J. Guibas, Dan Halperin: Vertical Decompositions for Triangles in 3-Space. Symposium on Computational Geometry 1994: 1-10

Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf: Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. Symposium on Computational Geometry 1994: 67-75

Mark de Berg, Katrin Dobrindt, Otfried Schwarzkopf: On lazy randomized incremental construction. STOC 1994: 105-114

Mark de Berg, Marko de Groot, Mark H. Overmars: New Results on Binary Space Partitions in the Plane (Extended Abstract). SWAT 1994: 61-72

Mark de Berg: Ray Shooting, Depth Orders and Hidden Surface Removal. Lecture Notes in Computer Science 703, Springer 1993, isbn 3-540-57020-9

Mark de Berg, Marko de Groot, Mark H. Overmars: Perfect Binary Space Partitions. CCCG 1993: 109-114

Mark de Berg: Generalized Hidden Surface Removal. Symposium on Computational Geometry 1993: 1-10

Mark de Berg, Marc J. van Kreveld: Trekking in the Alps Without Freezing or Getting Tired. ESA 1993: 121-132

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

Mark de Berg, Jirí Matousek, Otfried Schwarzkopf: Piecewise linear paths among convex obstacles. STOC 1993: 505-514

Mark de Berg: Efficient algorithms for ray shooting and hidden surface removal. Universität Utrecht 1992, pp. I-VIII, 1-225

Mark de Berg: Dynamic Output-sensitive Hidden Surface Removal for C-oriented Polyhedra. Comput. Geom. 2: 119-140 (1992)

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)

Mark de Berg, Svante Carlsson, Mark H. Overmars: A General Approach to Dominance in the Plane. J. Algorithms 13(2): 274-296 (1992)

Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf: Computing and Verifying Depth Orders. Symposium on Computational Geometry 1992: 138-145

Mark de Berg, Marc J. van Kreveld, Jack Snoeyink: Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract). SWAT 1992: 352-363

Marc J. van Kreveld, Mark de Berg: Finding Squares and Rectangles in Sets of Points. BIT 31(2): 202-219 (1991)

Mark de Berg: On Rectilinear Link Distance. Comput. Geom. 1: 13-34 (1991)

Mark de Berg, Mark H. Overmars: Hidden Surface Removal for C-oriented Polyhedra. Comput. Geom. 1: 247-268 (1991)

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

Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson: Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract). Symposium on Computational Geometry 1991: 51-60

Mark de Berg, Mark H. Overmars: Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract). FOCS 1990: 252-261

Mark de Berg: Translating Polygons with Applications to Hidden Surface Removal. SWAT 1990: 60-70

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

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)

Marc J. van Kreveld, Mark de Berg: Finding Squares and Rectangles in Sets of Points. WG 1989: 341-355

Mark de Berg, Mark H. Overmars: Dominance in the Presence of Obstracles. WG 1988: 190-201