The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mark de Berg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mark H. Overmars, Michiel H. M. Smid, Mark de Berg, Marc J. van Kreveld
    Maintaining Range Trees in Secondary Memory. Part I: Partitions. [Citation Graph (4, 0)][DBLP]
    Acta Inf., 1989, v:27, n:5, pp:423-452 [Journal]
  2. Mark de Berg, Katrin Dobrindt
    On Levels of Detail in Terrains. [Citation Graph (1, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:0-0 [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:43-46 [Conf]
  4. Mark de Berg, Prosenjit Bose, David Bremner, William S. Evans, Lata Narayanan
    Recovering lines with fixed linear probes. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:325-330 [Conf]
  6. Mark de Berg, Marko de Groot, Mark H. Overmars
    Perfect Binary Space Partitions. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:109-114 [Conf]
  7. Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong
    Computing the Angularity Tolerance. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:331-336 [Conf]
  8. Mark de Berg
    Visualization of TINs. [Citation Graph (0, 0)][DBLP]
    Algorithmic Foundations of Geographic Information Systems, 1996, pp:79-97 [Conf]
  9. Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki
    Spanning Trees Crossing Few Barriers. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:41-48 [Conf]
  10. Mohammad Ali Abam, Mark de Berg
    Kinetic sorting and kinetic convex hulls. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:190-197 [Conf]
  11. Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger
    Lower Bounds for Kinetic Planar Subdivisions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:247-254 [Conf]
  12. Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort
    Box-trees and R-trees with near-optimal query time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:124-133 [Conf]
  13. Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
    Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:67-75 [Conf]
  14. Lars Arge, Mark de Berg, Herman J. Haverkort
    Cache-oblivious r-trees. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:170-179 [Conf]
  15. Boris Aronov, Mark de Berg, Chris Gray
    Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:88-94 [Conf]
  16. Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels
    Motion Planning for Multiple Robots. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:374-382 [Conf]
  17. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf
    Separating an Object from its Cast. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:221-230 [Conf]
  18. Mark de Berg
    Vertical ray shooting for fat objects. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:288-295 [Conf]
  19. Mark de Berg
    Generalized Hidden Surface Removal. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:1-10 [Conf]
  20. Mark de Berg, João Comba, Leonidas J. Guibas
    A segment-tree based kinetic BSP. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:134-140 [Conf]
  21. Mark de Berg, Leonidas J. Guibas, Dan Halperin
    Vertical Decompositions for Triangles in 3-Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:1-10 [Conf]
  22. Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld
    Efficient Ray Shooting and Hidden Surface Removal. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:21-30 [Conf]
  23. Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson
    Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:51-60 [Conf]
  24. Mark de Berg, Matthew J. Katz, A. Frank van der Stappen, Jules Vleugels
    Realistic Input Models for Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:294-303 [Conf]
  25. Mark de Berg, René van Oostrum, Mark H. Overmars
    Simple Traversal of a Subdivision Without Extra Storage. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:0-5 [Conf]
  26. Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf
    Computing and Verifying Depth Orders. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:138-145 [Conf]
  27. Sergio Cabello, Mark de Berg, Steven van Dijk, Marc J. van Kreveld, Tycho Strijk
    Schematization of road networks. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:33-39 [Conf]
  28. Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson
    Box-trees for collision checking in industrial installations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:53-62 [Conf]
  29. Mohammad Ali Abam, Mark de Berg, Peter Hachenberger, Alireza Zarei
    Streaming algorithms for line simplification. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:175-183 [Conf]
  30. Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
    Kinetic KD-trees and longest-side KD-trees. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:364-372 [Conf]
  31. Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg, Hai Yu
    Out-of-Order Event Processing in Kinetic Data Structures. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:624-635 [Conf]
  32. Mohammad Ali Abam, Mark de Berg, Sheung-Hung Poon, Bettina Speckmann
    Kinetic Collision Detection for Convex Fat Objects. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:4-15 [Conf]
  33. Mark de Berg
    Kinetic Dictionaries: How to Shoot a Moving Target. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:172-183 [Conf]
  34. Mark de Berg
    Linear Size Binary Space Partitions for Fat Objects. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:252-263 [Conf]
  35. Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars
    On R-trees with Low Stabbing Number. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:167-178 [Conf]
  36. Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen
    TSP with Neighborhoods of Varying Size. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:187-199 [Conf]
  37. Mark de Berg, Herman J. Haverkort, Micha Streppel
    Efficient c-Oriented Range Searching with DOP-Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:508-519 [Conf]
  38. Mark de Berg, Marc J. van Kreveld
    Trekking in the Alps Without Freezing or Getting Tired. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:121-132 [Conf]
  39. Mark de Berg, Mark H. Overmars
    Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:252-261 [Conf]
  40. Mark de Berg
    Improved Bounds on the Union Complexity of Fat Objects. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:116-127 [Conf]
  41. Mark de Berg, Micha Streppel
    Approximate Range Searching Using Binary Space Partitions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:110-121 [Conf]
  42. Mark de Berg, Elena Mumford, Bettina Speckmann
    On Rectilinear Duals for Vertex-Weighted Plane Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:61-72 [Conf]
  43. Steven van Dijk, Dirk Thierens, Mark de Berg
    On The Design of Genetic Algorithms for Geographical Applications. [Citation Graph (0, 0)][DBLP]
    GECCO, 1999, pp:188-195 [Conf]
  44. Mark de Berg, Marc J. van Kreveld, René van Oostrum, Mark H. Overmars
    Simple Traversal of a Subdivision Without Extra Storage. [Citation Graph (0, 0)][DBLP]
    ACM-GIS, 1995, pp:77-0 [Conf]
  45. Mark de Berg, Elena Mumford, Bettina Speckmann
    Optimal BSPs and rectilinear cartograms. [Citation Graph (0, 0)][DBLP]
    GIS, 2006, pp:19-26 [Conf]
  46. Mark de Berg, Olivier Devillers, Marc J. van Kreveld, Otfried Schwarzkopf, Monique Teillaud
    Computing the Maximum Overlap of Two Convex Polygons Under Translations. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:126-135 [Conf]
  47. Mark de Berg, Mark H. Overmars, Leonidas J. Guibas, Otfried Schwarzkopf, Monique Teillaud, Dan Halperin, Micha Sharir
    Reaching a Goal with Directional Uncertainty. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:1-10 [Conf]
  48. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron
    Sparse Geometric Graphs with Small Dilation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:50-59 [Conf]
  49. Steven van Dijk, Dirk Thierens, Mark de Berg
    Scalability and Efficiency of Genetic Algorithms for Geometrical Applications. [Citation Graph (0, 0)][DBLP]
    PPSN, 2000, pp:683-692 [Conf]
  50. Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi
    The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2004, pp:347-358 [Conf]
  51. Pankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir
    Efficient Generation of k-Directional Assembly Sequences. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:122-131 [Conf]
  52. Mark de Berg, Chris Gray
    Vertical ray shooting and computing depth orders for fat objects. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:494-503 [Conf]
  53. Mark de Berg, Katrin Dobrindt, Otfried Schwarzkopf
    On lazy randomized incremental construction. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:105-114 [Conf]
  54. Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
    Piecewise linear paths among convex obstacles. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:505-514 [Conf]
  55. Paolo Ferragina, S. Muthukrishnan, Mark de Berg
    Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:483-491 [Conf]
  56. Mark de Berg, Marc J. van Kreveld, Jack Snoeyink
    Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:352-363 [Conf]
  57. 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. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:213-224 [Conf]
  58. Mark de Berg
    Translating Polygons with Applications to Hidden Surface Removal. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:60-70 [Conf]
  59. 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. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:138-149 [Conf]
  60. Mark de Berg, Marko de Groot, Mark H. Overmars
    New Results on Binary Space Partitions in the Plane (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:61-72 [Conf]
  61. Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
    Models and Motion Planning. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:83-94 [Conf]
  62. 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. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:122-134 [Conf]
  63. Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong
    Computing Constrained Minimum-Width Annuli of Point Sets. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:392-401 [Conf]
  64. Mark de Berg, Herman J. Haverkort
    Significant-Presence Range Queries in Categorical Data. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:462-473 [Conf]
  65. Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
    Guarding Scenes against Invasive Hypercubes. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1998, pp:110-120 [Conf]
  66. Mark de Berg, Sergio Cabello, Sariel Har-Peled
    Covering Many or Few Points with Unit Disks. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:55-68 [Conf]
  67. Mark de Berg, Mark H. Overmars
    Dominance in the Presence of Obstracles. [Citation Graph (0, 0)][DBLP]
    WG, 1988, pp:190-201 [Conf]
  68. Marc J. van Kreveld, Mark de Berg
    Finding Squares and Rectangles in Sets of Points. [Citation Graph (0, 0)][DBLP]
    WG, 1989, pp:341-355 [Conf]
  69. Mark de Berg, Xavier Goaoc, A. Frank van der Stappen
    A Polynomial-time Algorithm to Design Push Plans for Sensorless Parts Sorting. [Citation Graph (0, 0)][DBLP]
    Robotics: Science and Systems, 2005, pp:89-96 [Conf]
  70. Mark de Berg
    Linear Size Binary Space Partitions for Uncluttered Scenes. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:28, n:3, pp:353-366 [Journal]
  71. Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld
    Efficient Ray Shooting and Hidden Surface Removal. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:1, pp:30-53 [Journal]
  72. Mark de Berg, Marc J. van Kreveld
    Trekking in the Alps Without Freezing or Getting Tired. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:3, pp:306-323 [Journal]
  73. Mark de Berg, A. Frank van der Stappen, Jules Vleugels, Matthew J. Katz
    Realistic Input Models for Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:1, pp:81-97 [Journal]
  74. Marc J. van Kreveld, Mark de Berg
    Finding Squares and Rectangles in Sets of Points. [Citation Graph (0, 0)][DBLP]
    BIT, 1991, v:31, n:2, pp:202-219 [Journal]
  75. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf
    Separating an object from its cast. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 2002, v:34, n:8, pp:547-559 [Journal]
  76. Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong
    Computing constrained minimum-width annuli of point sets. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 1998, v:30, n:4, pp:267-275 [Journal]
  77. Mark de Berg
    Trends and Developments in Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Comput. Graph. Forum, 1997, v:16, n:1, pp:3-30 [Journal]
  78. 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. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:2, pp:195-207 [Journal]
  79. Mark de Berg
    On Rectilinear Link Distance. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:13-34 [Journal]
  80. Mark de Berg
    Dynamic Output-sensitive Hidden Surface Removal for C-oriented Polyhedra. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:119-140 [Journal]
  81. Mark de Berg
    Generalized Hidden Surface Removal. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1995, v:5, n:, pp:249-276 [Journal]
  82. Mark de Berg
    Computing Half-plane and Strip Discrepancy of Planar Point Sets. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:69-83 [Journal]
  83. Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat Morin
    On simplifying dot maps. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:1, pp:43-62 [Journal]
  84. Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
    Guarding scenes against invasive hypercubes. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:2, pp:99-117 [Journal]
  85. Mark de Berg, Hazel Everett, Leonidas J. Guibas
    The union of moving polygonal pseudodiscs - Combinatorial bounds and applications. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:11, n:2, pp:69-81 [Journal]
  86. Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars
    On R-trees with low query complexity. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:24, n:3, pp:179-195 [Journal]
  87. Mark de Berg, Marko de Groot, Mark H. Overmars
    New Results on Binary Space Partitions in the Plane. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:317-333 [Journal]
  88. Mark de Berg, Marko de Groot, Mark H. Overmars
    Perfect Binary Space Partitions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:81-91 [Journal]
  89. Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
    Models and motion planning. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:1, pp:53-68 [Journal]
  90. Mark de Berg, Marc J. van Kreveld, Otfried Schwarzkopf, Jack Snoeyink
    Point Location in Zones of K-flats in Arrangements. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:131-143 [Journal]
  91. Mark de Berg, Mark H. Overmars
    Hidden Surface Removal for C-oriented Polyhedra. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:247-268 [Journal]
  92. Mark de Berg, Micha Streppel
    Approximate range searching using binary space partitions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:33, n:3, pp:139-151 [Journal]
  93. Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff
    Optimal spanners for axis-aligned rectangles. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:1, pp:59-77 [Journal]
  94. Sergio Cabello, Mark de Berg, Marc J. van Kreveld
    Schematization of networks. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:3, pp:223-228 [Journal]
  95. Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson
    Box-trees for collision checking in industrial installations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:28, n:2-3, pp:113-135 [Journal]
  96. Mark de Berg, Dan Halperin, Mark H. Overmars
    An intersection-sensitive algorithm for snap rounding. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:3, pp:159-165 [Journal]
  97. Mark de Berg, Joachim Gudmundsson, René van Oostrum, Bettina Speckmann
    Editorial. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:1, pp:1- [Journal]
  98. Mark de Berg, Katrin Dobrindt
    On Levels of Detail in Terrains. [Citation Graph (0, 0)][DBLP]
    Graphical Models and Image Processing, 1998, v:60, n:1, pp:1-12 [Journal]
  99. Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels
    Motion Planning for Multiple Robots. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:4, pp:505-525 [Journal]
  100. Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger
    Lower Bounds for Kinetic Planar Subdivisions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:4, pp:721-733 [Journal]
  101. Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort
    Box-Trees and R-Trees with Near-Optimal Query Time. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:3, pp:291-312 [Journal]
  102. Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki
    Spanning Trees Crossing Few Barriers. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:4, pp:591-606 [Journal]
  103. Mark de Berg
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:32, n:2, pp:165-166 [Journal]
  104. Mark de Berg, Katrin Dobrindt, Otfried Schwarzkopf
    On Lazy Randomized Incremental Construction. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:14, n:3, pp:261-286 [Journal]
  105. Mark de Berg, Leonidas J. Guibas, Dan Halperin
    Vertical Decompositions for Triangles in 3-Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:15, n:1, pp:35-61 [Journal]
  106. Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
    Piecewise Linear Paths Among Convex Obstacles. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:14, n:1, pp:9-29 [Journal]
  107. A. Frank van der Stappen, Mark H. Overmars, Mark de Berg, Jules Vleugels
    Motion Planning in Environments with Low Obstacle Density. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:4, pp:561-587 [Journal]
  108. Steven van Dijk, Dirk Thierens, Mark de Berg
    On the Design and Analysis of Competent Selecto-recombinative GAs. [Citation Graph (0, 0)][DBLP]
    Evolutionary Computation, 2004, v:12, n:2, pp:243-267 [Journal]
  109. Steven van Dijk, Dirk Thierens, Mark de Berg
    Using Genetic Algorithms for Solving Hard Problems in GIS. [Citation Graph (0, 0)][DBLP]
    GeoInformatica, 2002, v:6, n:4, pp:381-413 [Journal]
  110. Mark de Berg, Marc J. van Kreveld, René van Oostrum, Mark H. Overmars
    Simple Traversal of a Subdivision Without Extra Storage. [Citation Graph (0, 0)][DBLP]
    International Journal of Geographical Information Science, 1997, v:11, n:4, pp:359-373 [Journal]
  111. Mark de Berg, Otfried Schwarzkopf
    Cuttings and applications. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:4, pp:343-355 [Journal]
  112. Mark de Berg, Hazel Everett, Hubert Wagener
    Translation queries for sets of polygons. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:3, pp:221-242 [Journal]
  113. Mark de Berg, Dan Halperin, Mark H. Overmars, Marc J. van Kreveld
    Sparse Arrangements and the Number of Views of Polyhedral Scenes. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:3, pp:175-195 [Journal]
  114. Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars
    Shortest path queries in rectilinear worlds. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:3, pp:287-309 [Journal]
  115. Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong
    Computing the Angularity Tolerance. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1998, v:8, n:4, pp:467-0 [Journal]
  116. Mark de Berg, Stefan Schirra
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:1-2, pp:1-2 [Journal]
  117. Mark de Berg, Olivier Devillers, Katrin Dobrindt, Otfried Schwarzkopf
    Computing a Single Cell in the Overlay of Two Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:4, pp:215-219 [Journal]
  118. Mark de Berg, Marc J. van Kreveld
    Rectilinear Decompositions with Low Stabbing Number. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:52, n:4, pp:215-221 [Journal]
  119. Mark de Berg, A. Frank van der Stappen
    On the fatness of Minkowski sums. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:5, pp:259-264 [Journal]
  120. Mark de Berg, Svante Carlsson, Mark H. Overmars
    A General Approach to Dominance in the Plane. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:2, pp:274-296 [Journal]
  121. Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen
    TSP with neighborhoods of varying size. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:57, n:1, pp:22-36 [Journal]
  122. Mark de Berg, Marc J. van Kreveld, Jack Snoeyink
    Two- and Three-Dimensional Point Location in Rectangular Subdivisions. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:2, pp:256-277 [Journal]
  123. Mark de Berg, Otfried Cheong, Olivier Devillers, Marc J. van Kreveld, Monique Teillaud
    Computing the Maximum Overlap of Two Convex Polygons under Translations. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:5, pp:613-628 [Journal]
  124. Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
    Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:3, pp:654-667 [Journal]
  125. Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf
    Computing and Verifying Depth Orders. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:2, pp:437-446 [Journal]
  126. Mark de Berg, Leonidas J. Guibas, Dan Halperin, Mark H. Overmars, Otfried Schwarzkopf, Micha Sharir, Monique Teillaud
    Reaching a Goal with Directional Uncertainty. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:140, n:2, pp:301-317 [Journal]
  127. Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson
    Region-fault tolerant geometric spanners. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:1-10 [Conf]
  128. Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma
    I/O-Efficient Flow Modeling on Fat Terrains. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:239-250 [Conf]
  129. Mark de Berg, Chris Gray
    Computing the Visibility Map of Fat Objects. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:251-262 [Conf]
  130. Mohammad Ali Abam, Mark de Berg
    Kinetic sorting and kinetic convex hulls. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:1, pp:16-26 [Journal]
  131. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron
    Sparse geometric graphs with small dilation [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  132. Fault-Tolerant Conflict-Free Coloring. [Citation Graph (, )][DBLP]


  133. Finding monochromatic l-shapes in bichromatic point sets. [Citation Graph (, )][DBLP]


  134. Optimal Binary Space Partitions in the Plane. [Citation Graph (, )][DBLP]


  135. A simple and efficient kinetic spanner. [Citation Graph (, )][DBLP]


  136. Visibility maps of realistic terrains have linear smoothed complexity. [Citation Graph (, )][DBLP]


  137. Rectangular cartograms: the game. [Citation Graph (, )][DBLP]


  138. Kinetic spanners in Rd. [Citation Graph (, )][DBLP]


  139. Better bounds on the union complexity of locally fat objects. [Citation Graph (, )][DBLP]


  140. The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. [Citation Graph (, )][DBLP]


  141. The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains. [Citation Graph (, )][DBLP]


  142. Decompositions and Boundary Coverings of Non-convex Fat Polyhedra. [Citation Graph (, )][DBLP]


  143. Geometric Spanners for Weighted Point Sets. [Citation Graph (, )][DBLP]


  144. Lower bounds for kinetic sorting. [Citation Graph (, )][DBLP]


  145. Computing push plans for disk-shaped robots. [Citation Graph (, )][DBLP]


  146. I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions. [Citation Graph (, )][DBLP]


  147. Cutting cycles of rods in space: hardness and approximation. [Citation Graph (, )][DBLP]


  148. The Traveling Salesman Problem under Squared Euclidean Distances. [Citation Graph (, )][DBLP]


  149. Approximation Algorithms for Free-Label Maximization. [Citation Graph (, )][DBLP]


  150. Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy. [Citation Graph (, )][DBLP]


  151. Spatial Support and Spatial Confidencefor Spatial Association Rules. [Citation Graph (, )][DBLP]


  152. Kinetic Collision Detection for Convex Fat Objects. [Citation Graph (, )][DBLP]


  153. Cache-Oblivious R-Trees. [Citation Graph (, )][DBLP]


  154. Sparse geometric graphs with small dilation. [Citation Graph (, )][DBLP]


  155. Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. [Citation Graph (, )][DBLP]


  156. Efficient c-oriented range searching with DOP-trees. [Citation Graph (, )][DBLP]


  157. Computing the visibility map of fat objects. [Citation Graph (, )][DBLP]


  158. Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions. [Citation Graph (, )][DBLP]


  159. A simple and efficient kinetic spanner. [Citation Graph (, )][DBLP]


  160. The complexity of flow on fat terrains and its i/o-efficient computation. [Citation Graph (, )][DBLP]


  161. Decompositions and boundary coverings of non-convex fat polyhedra. [Citation Graph (, )][DBLP]


  162. Cache-Oblivious Selection in Sorted X+Y Matrices [Citation Graph (, )][DBLP]


  163. The Traveling Salesman Problem Under Squared Euclidean Distances [Citation Graph (, )][DBLP]


  164. Region-Fault Tolerant Geometric Spanners. [Citation Graph (, )][DBLP]


  165. Improved Bounds on the Union Complexity of Fat Objects. [Citation Graph (, )][DBLP]


  166. Streaming Algorithms for Line Simplification. [Citation Graph (, )][DBLP]


  167. On rectilinear duals for vertex-weighted plane graphs. [Citation Graph (, )][DBLP]


Search in 0.273secs, Finished in 0.279secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002