| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Mark de Berg 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: Guest Editor's Foreword. Discrete & Computational Geometry 32 (2): 165-166 (2004) 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, 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, 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 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, A. Frank van der Stappen , Jules Vleugels , Matthew J. Katz : Realistic Input Models for Geometric Algorithms. Algorithmica 34 (1): 81-97 (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) 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) 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, A. Frank van der Stappen : On the fatness of Minkowski sums. Inf. Process. Lett. 81 (5): 259-264 (2002) Mark de Berg, Stefan Schirra : Guest Editor's Foreword. Int. J. Comput. Geometry Appl. 12 (1-2): 1-2 (2002) 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 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, 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, 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 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) 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 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 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 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) 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, Jit Bose , David Bremner , William S. Evans , Lata Narayanan : Recovering lines with fixed linear probes. CCCG 1998 Mark de Berg, Matthew J. Katz , Mark H. Overmars , A. Frank van der Stappen , Jules Vleugels : Models and Motion Planning. SWAT 1998 : 83-94 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, 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, Prosenjit Bose , David Bremner , Suneeta Ramaswami , Gordon Wilfong : Computing constrained minimum-width annuli of point sets. Computer-Aided Design 30 (4): 267-275 (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, Katrin Dobrindt : On Levels of Detail in Terrains. Graphical Models and Image Processing 60 (1): 1-12 (1998) Mark de Berg, Henk Meijer , Mark H. Overmars , Gordon T. Wilfong : Computing the Angularity Tolerance. Int. J. Comput. Geometry Appl. 8 (4): 467- (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, 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) 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, Marc J. van Kreveld : Trekking in the Alps Without Freezing or Getting Tired. Algorithmica 18 (3): 306-323 (1997) Mark de Berg, Marko M. 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: Trends and Developments in Computational Geometry. Comput. Graph. Forum 16 (1): 3-30 (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) 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, 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: Visualization of TINs. Algorithmic Foundations of Geographic Information Systems 1996 : 79-97 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, 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, 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, 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: Computing Half-plane and Strip Discrepancy of Planar Point Sets. Comput. Geom. 6 : 69-83 (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, 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: Linear Size Binary Space Partitions for Fat Objects. ESA 1995 : 252-263 Mark de Berg, Katrin Dobrindt : On Levels of Detail in Terrains. Symposium on Computational Geometry 1995 : C26-C27 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 , 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, 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, 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: Ray Shooting, Depth Orders and Hidden Surface Removal Springer 1993 Mark de Berg, Marko de Groot , Mark H. Overmars : Perfect Binary Space Partitions. CCCG 1993 : 109-114 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: Generalized Hidden Surface Removal. Symposium on Computational Geometry 1993 : 1-10 Mark de Berg, Marc J. van Kreveld , Jack Snoeyink : Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract). SWAT 1992 : 352-363 Mark de Berg, Mark H. Overmars , Otfried Schwarzkopf : Computing and Verifying Depth Orders. Symposium on Computational Geometry 1992 : 138-145 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, 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 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, Mark H. Overmars : Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract) FOCS 1990 : 252-261 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 de Berg: Translating Polygons with Applications to Hidden Surface Removal. SWAT 1990 : 60-70 Marc J. van Kreveld , Mark de Berg: Finding Squares and Rectangles in Sets of Points. WG 1989 : 341-355 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) Mark de Berg, Mark H. Overmars : Dominance in the Presence of Obstracles. WG 1988 : 190-201 1 [ 26 ] [ 44 ] [ 60 ] [ 72 ] [ 75 ] [ 79 ] [ 82 ] [ 86 ] [ 88 ] 2 [ 58 ] [ 87 ] 3 [ 100 ] 4 [ 66 ] [ 70 ] 5 [ 71 ] [ 93 ] 6 [ 72 ] [ 75 ] 7 [ 68 ] 8 [ 47 ] [ 56 ] [ 58 ] [ 64 ] [ 87 ] 9 [ 56 ] [ 64 ] [ 68 ] 10 [ 80 ] [ 99 ] 11 [ 12 ] 12 [ 58 ] [ 87 ] 13 [ 59 ] [ 71 ] [ 93 ] 14 [ 81 ] 15 [ 69 ] [ 94 ] 16 [ 45 ] [ 51 ] [ 59 ] 17 [ 74 ] [ 77 ] [ 80 ] [ 85 ] 18 [ 29 ] [ 34 ] [ 37 ] [ 47 ] [ 51 ] [ 62 ] 19 [ 68 ] 20 [ 33 ] [ 65 ] 21 [ 73 ] 22 [ 99 ] 23 [ 54 ] 24 [ 21 ] [ 28 ] [ 47 ] [ 53 ] 25 [ 78 ] [ 82 ] [ 86 ] [ 91 ] [ 92 ] [ 95 ] 26 [ 19 ] [ 27 ] [ 30 ] [ 40 ] [ 65 ] [ 71 ] [ 72 ] [ 75 ] [ 81 ] [ 93 ] 27 [ 11 ] [ 19 ] [ 25 ] [ 27 ] [ 30 ] [ 40 ] [ 44 ] [ 50 ] [ 58 ] [ 87 ] 28 [ 78 ] [ 82 ] [ 86 ] [ 95 ] 29 [ 79 ] [ 88 ] 30 [ 82 ] [ 86 ] [ 91 ] [ 96 ] [ 100 ] 31 [ 72 ] [ 75 ] 32 [ 57 ] [ 67 ] [ 69 ] [ 89 ] [ 90 ] [ 92 ] [ 94 ] 33 [ 99 ] 34 [ 2 ] [ 3 ] [ 5 ] [ 9 ] [ 10 ] [ 11 ] [ 13 ] [ 16 ] [ 20 ] [ 24 ] [ 25 ] [ 31 ] [ 39 ] [ 42 ] [ 45 ] [ 47 ] [ 49 ] [ 50 ] [ 55 ] [ 59 ] [ 80 ] 35 [ 92 ] 36 [ 18 ] [ 26 ] [ 35 ] [ 58 ] [ 60 ] [ 87 ] 37 [ 46 ] [ 61 ] 38 [ 73 ] 39 [ 68 ] 40 [ 5 ] [ 10 ] [ 13 ] 41 [ 39 ] [ 43 ] [ 49 ] [ 99 ] 42 [ 1 ] [ 2 ] [ 5 ] [ 6 ] [ 7 ] [ 11 ] [ 12 ] [ 13 ] [ 15 ] [ 19 ] [ 21 ] [ 23 ] [ 25 ] [ 28 ] [ 30 ] [ 39 ] [ 43 ] [ 46 ] [ 47 ] [ 49 ] [ 50 ] [ 53 ] [ 54 ] [ 61 ] [ 63 ] [ 67 ] [ 69 ] [ 78 ] [ 79 ] [ 88 ] [ 89 ] [ 92 ] [ 94 ] [ 95 ] 43 [ 56 ] [ 64 ] 44 [ 47 ] 45 [ 83 ] 46 [ 15 ] [ 18 ] [ 19 ] [ 23 ] [ 26 ] [ 29 ] [ 30 ] [ 32 ] [ 34 ] [ 35 ] [ 42 ] [ 45 ] [ 51 ] [ 58 ] [ 60 ] [ 87 ] 47 [ 19 ] [ 30 ] [ 44 ] [ 79 ] [ 88 ] 48 [ 2 ] 49 [ 11 ] [ 16 ] [ 25 ] [ 31 ] [ 42 ] [ 47 ] [ 71 ] [ 93 ] 50 [ 57 ] [ 63 ] [ 66 ] [ 67 ] [ 69 ] [ 70 ] [ 84 ] [ 89 ] [ 90 ] [ 92 ] [ 94 ] 51 [ 101 ] 52 [ 80 ] 53 [ 66 ] [ 70 ] 54 [ 71 ] [ 93 ] 55 [ 19 ] [ 30 ] [ 45 ] [ 59 ] 56 [ 74 ] [ 77 ] [ 85 ] 57 [ 79 ] [ 88 ] 58 [ 99 ] 59 [ 57 ] [ 63 ] [ 66 ] [ 67 ] [ 69 ] [ 70 ] [ 89 ] [ 90 ] [ 94 ] 60 [ 33 ] 61 [ 64 ] 62 [ 46 ] [ 56 ] [ 61 ] 63 [ 100 ] 64 [ 47 ]  ©2005 Association for Computing Machinery |
