Mark de Berg

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2013
196Fast Fréchet queries. Mark de Berg, Atlas F. Cook IV, Joachim Gudmundsson. Comput. Geom. (46): 747-755 (2013). Web SearchBibTeXDownload
2012
195Guest Editorial. Darrell Conklin, Tadeusz A. Wysocki, Hamid Sharif, L. C. Gundersen, P. P. Leahy, W. Hill, Jyh-Horng Wen, Shiuh-Jeng Wang, Yuh-Ren Tsai, Keh-Ming Lu. Algorithmica (63): 731-732 (2012). Cited by 2Web SearchBibTeXDownload
194Approximation algorithms for free-label maximization. Mark de Berg, Dirk H. P. Gerrits. Comput. Geom. (45): 153-168 (2012). Web SearchBibTeXDownload
193Unions of Fat Convex Polytopes Have Short Skeletons. Boris Aronov, Mark de Berg. Discrete & Computational Geometry (48): 53-64 (2012). Web SearchBibTeXDownload
192Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes. Mark de Berg, Marcel Roeloffzen, Bettina Speckmann. ESA 2012, 383-394. Web SearchBibTeXDownload
191Optimal Binary Space Partitions for Segments in the Plane. Mark de Berg, Amirali Khosravi. Int. J. Comput. Geometry Appl. (22): 187-206 (2012). Web SearchBibTeXDownload
190Kinetic Convex Hulls, Delaunay Triangulations and Connectivity Structures in the Black-Box Model. Mark de Berg, Marcel Roeloffzen, Bettina Speckmann. JoCG (3): 222-249 (2012). Web SearchBibTeXDownload
2011
189Out-of-Order Event Processing in Kinetic Data Structures. Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg, Hai Yu. Algorithmica (60): 250-273 (2011). Web SearchBibTeXDownload
188Geometric Spanners for Weighted Point Sets. Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid. Algorithmica (61): 207-225 (2011). Web SearchBibTeXDownload
187Delineating imprecise regions via shortest-path graphs. Mark de Berg, Wouter Meulemans, Bettina Speckmann. GIS 2011, 271-280. Web SearchBibTeXDownload
186Exact and approximate computations of watersheds on triangulated terrains. Mark de Berg, Constantinos P. Tsirogiannis. GIS 2011, 74-83. Web SearchBibTeXDownload
185Fast Fréchet Queries. Mark de Berg, Atlas F. Cook IV, Joachim Gudmundsson. ISAAC 2011, 240-249. Web SearchBibTeXDownload
184Treemaps with Bounded Aspect Ratio. Mark de Berg, Bettina Speckmann, Vincent van der Weele. ISAAC 2011, 260-270. Web SearchBibTeXDownload
183Implicit Flow Routing on Terrains with Applications to Surface Networks and Drainage Structures. Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis. SODA 2011, 285-296. Web SearchBibTeXDownload
182Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons. Mohammad Ali Abam, Boris Aronov, Mark de Berg, Amirali Khosravi. Symposium on Computational Geometry 2011, 407-416. Web SearchBibTeXDownload
181Kinetic convex hulls and delaunay triangulations in the black-box model. Mark de Berg, Marcel Roeloffzen, Bettina Speckmann. Symposium on Computational Geometry 2011, 244-253. Web SearchBibTeXDownload
180Go with the Flow: The Direction-Based Fréchet Distance of Polygonal Curves. Mark de Berg, Atlas F. Cook. TAPAS 2011, 81-91. Web SearchBibTeXDownload
179On Rectilinear Partitions with Minimum Stabbing Number. Mark de Berg, Amirali Khosravi, Sander Verdonschot, Vincent van der Weele. WADS 2011, 302-313. Web SearchBibTeXDownload
178Piecewise-Linear Approximations of Uncertain Functions. Mohammad Ali Abam, Mark de Berg, Amirali Khosravi. WADS 2011, 1-12. Web SearchBibTeXDownload
2010
177Finding monochromatic l-shapes in bichromatic point sets. Farnaz Sheikhi, Mark de Berg, Ali Mohades, Mansoor Davoodi Monfared. CCCG 2010, 269-272. Web SearchBibTeXDownload
176Optimal Binary Space Partitions in the Plane. Mark de Berg, Amirali Khosravi. COCOON 2010, 216-225. Web SearchBibTeXDownload
175The complexity of flow on fat terrains and its i/o-efficient computation. Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma. Comput. Geom. (43): 331-356 (2010). Web SearchBibTeXDownload
174Computing the visibility map of fat objects. Mark de Berg, Chris Gray. Comput. Geom. (43): 410-418 (2010). Web SearchBibTeXDownload
173A simple and efficient kinetic spanner. Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson. Comput. Geom. (43): 251-256 (2010). Web SearchBibTeXDownload
172Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions. Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma. Comput. Geom. (43): 493-513 (2010). Web SearchBibTeXDownload
171Decompositions and boundary coverings of non-convex fat polyhedra. Mark de Berg, Chris Gray. Comput. Geom. (43): 73-83 (2010). Web SearchBibTeXDownload
170Treemaps with Bounded Aspect Ratio. Mark de Berg, Bettina Speckmann, Vincent van der Weele. CoRR (abs/1012.1749) (2010). Web SearchBibTeXDownload
169Fat Polygonal Partitions with Applications to Visualization and Embeddings. Mark de Berg, Krzysztof Onak, Anastasios Sidiropoulos. CoRR (abs/1009.1866) (2010). Web SearchBibTeXDownload
168The Traveling Salesman Problem Under Squared Euclidean Distances. Mark de Berg, Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff. CoRR (abs/1001.0236) (2010). Web SearchBibTeXDownload
167Streaming Algorithms for Line Simplification. Mohammad Ali Abam, Mark de Berg, Peter Hachenberger, Alireza Zarei. Discrete & Computational Geometry (43): 497-515 (2010). Web SearchBibTeXDownload
166Computing push plans for disk-shaped robots. Mark de Berg, Dirk H. P. Gerrits. ICRA 2010, 4487-4492. Web SearchBibTeXDownload
165Optimal BSPs and Rectilinear Cartograms. Mark de Berg, Elena Mumford, Bettina Speckmann. Int. J. Comput. Geometry Appl. (20): 203-222 (2010). Web SearchBibTeXDownload
164Visibility Maps of Realistic Terrains have Linear Smoothed Complexity. Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis. JoCG (1): 57-71 (2010). Web SearchBibTeXDownload
163The Traveling Salesman Problem under Squared Euclidean Distances. Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff, Mark de Berg. STACS 2010, 239-250. Web SearchBibTeXDownload
162Approximation Algorithms for Free-Label Maximization. Mark de Berg, Dirk H. P. Gerrits. SWAT 2010, 297-308. Web SearchBibTeXDownload
161Better bounds on the union complexity of locally fat objects. Mark de Berg. Symposium on Computational Geometry 2010, 39-47. Web SearchBibTeXDownload
2009
160Cache-Oblivious R-Trees. Lars Arge, Mark de Berg, Herman J. Haverkort. Algorithmica (53): 50-68 (2009). Cited by 12Web SearchBibTeXDownload
159Kinetic Collision Detection for Convex Fat Objects. Mohammad Ali Abam, Mark de Berg, Sheung-Hung Poon, Bettina Speckmann. Algorithmica (53): 457-473 (2009). Web SearchBibTeXDownload
158Efficient c-oriented range searching with DOP-trees. Mark de Berg, Herman J. Haverkort, Micha Streppel. Comput. Geom. (42): 250-267 (2009). Web SearchBibTeXDownload
157Region-Fault Tolerant Geometric Spanners. Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson. Discrete & Computational Geometry (41): 556-582 (2009). Web SearchBibTeXDownload
156On rectilinear duals for vertex-weighted plane graphs. Mark de Berg, Elena Mumford, Bettina Speckmann. Discrete Mathematics (309): 1794-1812 (2009). Web SearchBibTeXDownload
155Geometric Spanners for Weighted Point Sets. Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid. ESA 2009, 190-202. Web SearchBibTeXDownload
154Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. Sergio Cabello, Mark de Berg, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp. Int. J. Comput. Geometry Appl. (19): 533-556 (2009). Web SearchBibTeXDownload
153Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy. Mark de Berg, Peter Hachenberger. SEA 2009, 63-75. Web SearchBibTeXDownload
152Kinetic kd-Trees and Longest-Side kd-Trees. Mohammad Ali Abam, Mark de Berg, Bettina Speckmann. SIAM J. Comput. (39): 1219-1232 (2009). Web SearchBibTeXDownload
151Rectangular cartograms: the game. Mark de Berg, Fred van Nijnatten, Bettina Speckmann, Kevin Verbeek. Symposium on Computational Geometry 2009, 96-97. Web SearchBibTeXDownload
150Visibility maps of realistic terrains have linear smoothed complexity. Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis. Symposium on Computational Geometry 2009, 163-168. Web SearchBibTeXDownload
149Kinetic spanners in Rd. Mohammad Ali Abam, Mark de Berg. Symposium on Computational Geometry 2009, 43-50. Web SearchBibTeXDownload
148Covering Many or Few Points with Unit Disks. Mark de Berg, Sergio Cabello, Sariel Har-Peled. Theory Comput. Syst. (45): 446-469 (2009). Web SearchBibTeXDownload
2008
147The priority R-tree: A practically efficient and worst-case optimal R-tree. Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi. ACM Transactions on Algorithms (4) (2008). Cited by 63Web SearchBibTeXDownload
146Fault-Tolerant Conflict-Free Coloring. Mohammad Ali Abam, Mark de Berg, Sheung-Hung Poon. CCCG 2008. Web SearchBibTeX
145Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. Boris Aronov, Mark de Berg, Chris Gray. Comput. Geom. (41): 68-76 (2008). Web SearchBibTeXDownload
144Sparse geometric graphs with small dilation. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron. Comput. Geom. (40): 207-219 (2008). Web SearchBibTeXDownload
143Cache-Oblivious Selection in Sorted X+Y Matrices. Mark de Berg, Shripad Thite. CoRR (abs/0804.0936) (2008). Web SearchBibTeXDownload
142Improved Bounds on the Union Complexity of Fat Objects. Mark de Berg. Discrete & Computational Geometry (40): 127-140 (2008). Web SearchBibTeXDownload
141Decompositions and Boundary Coverings of Non-convex Fat Polyhedra. Mark de Berg, Chris Gray. ESA 2008, 173-184. Web SearchBibTeXDownload
140The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains. Boris Aronov, Mark de Berg, Shripad Thite. ESA 2008, 100-111. Web SearchBibTeXDownload
139Cache-oblivious selection in sorted X. Mark de Berg, Shripad Thite. Inf. Process. Lett. (109): 87-92 (2008). Web SearchBibTeXDownload
138Spatial Support and Spatial Confidence for Spatial Association Rules. Patrick Laube, Mark de Berg, Marc J. van Kreveld. SDH 2008, 575-593. Web SearchBibTeXDownload
137Spatial Support and Spatial Confidencefor Spatial Association Rules. Patrick Laube, Mark de Berg, Marc J. van Kreveld. SDH 2008, 575-593. Web SearchBibTeXDownload
136Vertical Ray Shooting and Computing Depth Orders for Fat Objects. Mark de Berg, Chris Gray. SIAM J. Comput. (38): 257-275 (2008). Web SearchBibTeXDownload
135Cutting cycles of rods in space: hardness and approximation. Boris Aronov, Mark de Berg, Chris Gray, Elena Mumford. SODA 2008, 1241-1248. Web SearchBibTeXDownload
134A simple and efficient kinetic spanner. Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson. Symposium on Computational Geometry 2008, 306-310. Web SearchBibTeXDownload
2007
133An intersection-sensitive algorithm for snap rounding. Mark de Berg, Dan Halperin, Mark H. Overmars. Comput. Geom. (36): 159-165 (2007). Web SearchBibTeXDownload
132Kinetic sorting and kinetic convex hulls. Mohammad Ali Abam, Mark de Berg. Comput. Geom. (37): 16-26 (2007). Web SearchBibTeXDownload
131Sparse geometric graphs with small dilation. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron. CoRR (abs/cs/0702080) (2007). Web SearchBibTeXDownload
130I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions. Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma. ISAAC 2007, 500-511. Web SearchBibTeXDownload
129Region-fault tolerant geometric spanners. Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson. SODA 2007, 1-10. Web SearchBibTeXDownload
128Streaming algorithms for line simplification. Mohammad Ali Abam, Mark de Berg, Peter Hachenberger, Alireza Zarei. Symposium on Computational Geometry 2007, 175-183. Web SearchBibTeXDownload
127Kinetic KD-trees and longest-side KD-trees. Mohammad Ali Abam, Mark de Berg, Bettina Speckmann. Symposium on Computational Geometry 2007, 364-372. Web SearchBibTeXDownload
126I/O-Efficient Flow Modeling on Fat Terrains. Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma. WADS 2007, 239-250. Web SearchBibTeXDownload
125Computing the Visibility Map of Fat Objects. Mark de Berg, Chris Gray. WADS 2007, 251-262. Web SearchBibTeXDownload
2006
124Approximate range searching using binary space partitions. Mark de Berg, Micha Streppel. Comput. Geom. (33): 139-151 (2006). Web SearchBibTeXDownload
123Out-of-Order Event Processing in Kinetic Data Structures. Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg, Hai Yu. ESA 2006, 624-635. Web SearchBibTeXDownload
122Kinetic Collision Detection for Convex Fat Objects. Mohammad Ali Abam, Mark de Berg, Sheung-Hung Poon, Bettina Speckmann. ESA 2006, 4-15. Web SearchBibTeXDownload
121Optimal BSPs and rectilinear cartograms. Mark de Berg, Elena Mumford, Bettina Speckmann. GIS 2006, 19-26. Web SearchBibTeXDownload
120Vertical ray shooting and computing depth orders for fat objects. Mark de Berg, Chris Gray. SODA 2006, 494-503. Web SearchBibTeXDownload
119Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. Boris Aronov, Mark de Berg, Chris Gray. Symposium on Computational Geometry 2006, 88-94. Web SearchBibTeXDownload
118Covering Many or Few Points with Unit Disks. Mark de Berg, Sergio Cabello, Sariel Har-Peled. WAOA 2006, 55-68. Web SearchBibTeXDownload
2005
117Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points. Pankaj K. Agarwal, Mark de Berg, Jie Gao, Leonidas J. Guibas, Sariel Har-Peled. CCCG 2005, 43-46. Web SearchBibTeXDownload
116Optimal spanners for axis-aligned rectangles. Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff. Comput. Geom. (30): 59-77 (2005). Web SearchBibTeXDownload
115Schematization of networks. Sergio Cabello, Mark de Berg, Marc J. van Kreveld. Comput. Geom. (30): 223-228 (2005). Web SearchBibTeXDownload
114Efficient c-Oriented Range Searching with DOP-Trees. Mark de Berg, Herman J. Haverkort, Micha Streppel. ESA 2005, 508-519. Web SearchBibTeXDownload
113Lower bounds for kinetic sorting. Mohammad Ali Abam, Mark de Berg. EuroCG 2005, 171-174. Web SearchBibTeXDownload
112Improved Bounds on the Union Complexity of Fat Objects. Mark de Berg. FSTTCS 2005, 116-127. Web SearchBibTeXDownload
111On Rectilinear Duals for Vertex-Weighted Plane Graphs. Mark de Berg, Elena Mumford, Bettina Speckmann. Graph Drawing 2005, 61-72. Web SearchBibTeXDownload
110Sparse Geometric Graphs with Small Dilation. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron. ISAAC 2005, 50-59. Web SearchBibTeXDownload
109TSP with neighborhoods of varying size. Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen. J. Algorithms (57): 22-36 (2005). Web SearchBibTeXDownload
108A Polynomial-time Algorithm to Design Push Plans for Sensorless Parts Sorting. Mark de Berg, Xavier Goaoc, A. Frank van der Stappen. Robotics: Science and Systems 2005, 89-96. Web SearchBibTeXDownload
107Kinetic sorting and kinetic convex hulls. Mohammad Ali Abam, Mark de Berg. Symposium on Computational Geometry 2005, 190-197. Web SearchBibTeXDownload
106Cache-oblivious r-trees. Lars Arge, Mark de Berg, Herman J. Haverkort. Symposium on Computational Geometry 2005, 170-179. Web SearchBibTeXDownload
105Vertical ray shooting for fat objects. Mark de Berg. Symposium on Computational Geometry 2005, 288-295. Web SearchBibTeXDownload
2004
104The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi. Cache-Oblivious and Cache-Aware Algorithms 2004. Web SearchBibTeXDownload
103On simplifying dot maps. Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat Morin. Comput. Geom. (27): 43-62 (2004). Web SearchBibTeXDownload
102Box-trees for collision checking in industrial installations. Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson. Comput. Geom. (28): 113-135 (2004). Web SearchBibTeXDownload
101Guest Editor's Foreword. Sandip Das, Emden R. Gansner, Joe Kilian, Jon M. Kleinberg. Discrete & Computational Geometry (31): 1 (2004). Web SearchBibTeXDownload
100On the Design and Analysis of Competent Selecto-recombinative GAs. Steven van Dijk, Dirk Thierens, Mark de Berg. Evolutionary Computation (12): 243-267 (2004). Web SearchBibTeXDownload
99Approximate Range Searching Using Binary Space Partitions. Mark de Berg, Micha Streppel. FSTTCS 2004, 110-121. Web SearchBibTeXDownload
98The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree. Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi. SIGMOD Conference 2004, 347-358. Web SearchBibTeXDownload
97Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion. Mark de Berg, Sergio Cabello, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp. SWAT 2004, 138-149. Web SearchBibTeXDownload
2003
96On R-trees with low query complexity. Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars. Comput. Geom. (24): 179-195 (2003). Web SearchBibTeXDownload
95Guarding scenes against invasive hypercubes. Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels. Comput. Geom. (26): 99-117 (2003). Web SearchBibTeXDownload
94Spanning Trees Crossing Few Barriers. Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki. Discrete & Computational Geometry (30): 591-606 (2003). Web SearchBibTeXDownload
93Kinetic Dictionaries: How to Shoot a Moving Target. Mark de Berg. ESA 2003, 172-183. Web SearchBibTeXDownload
92Significant-Presence Range Queries in Categorical Data. Mark de Berg, Herman J. Haverkort. WADS 2003, 462-473. Web SearchBibTeXDownload
2002
91Realistic Input Models for Geometric Algorithms. Mark de Berg, Matthew J. Katz, Jules Vleugels, Jules Vleugels. Algorithmica (34): 81-97 (2002). Web SearchBibTeXDownload
90Separating an object from its cast. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf. Computer-Aided Design (34): 547-559 (2002). Web SearchBibTeXDownload
89Models and motion planning. Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels. Comput. Geom. (23): 53-68 (2002). Web SearchBibTeXDownload
88Reporting intersecting pairs of convex polytopes in two and three dimensions. Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold. Comput. Geom. (23): 195-207 (2002). Web SearchBibTeXDownload
87Box-Trees and R-Trees with Near-Optimal Query Time. Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort. Discrete & Computational Geometry (28): 291-312 (2002). Web SearchBibTeXDownload
86TSP with Neighborhoods of Varying Size. Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen. ESA 2002, 187-199. Web SearchBibTeXDownload
85Using Genetic Algorithms for Solving Hard Problems in GIS. Steven van Dijk, Dirk Thierens, Mark de Berg. GeoInformatica (6): 381-413 (2002). Web SearchBibTeXDownload
84On the fatness of Minkowski sums. Mark de Berg, A. Frank van der Stappen. Inf. Process. Lett. (81): 259-264 (2002). Web SearchBibTeXDownload
83Guest Editor's Foreword. Sandip Das, Emden R. Gansner, Joe Kilian, Jon M. Kleinberg. Int. J. Comput. Geometry Appl. (12): 267-268 (2002). Web SearchBibTeXDownload
82Box-trees for collision checking in industrial installations. Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson. Symposium on Computational Geometry 2002, 53-62. Web SearchBibTeXDownload
2001
81Schematization of road networks. Sergio Cabello, Mark de Berg, Steven van Dijk, Marc J. van Kreveld, Tycho Strijk. Symposium on Computational Geometry 2001, 33-39. Web SearchBibTeXDownload
80Box-trees and R-trees with near-optimal query time. Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort. Symposium on Computational Geometry 2001, 124-133. Web SearchBibTeXDownload
79A segment-tree based kinetic BSP. Mark de Berg, Joăo Comba, Leonidas J. Guibas. Symposium on Computational Geometry 2001, 134-140. Web SearchBibTeXDownload
78Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold. WADS 2001, 122-134. Web SearchBibTeXDownload
2000
77Linear Size Binary Space Partitions for Uncluttered Scenes. Mark de Berg. Algorithmica (28): 353-366 (2000). Web SearchBibTeXDownload
76Lower Bounds for Kinetic Planar Subdivisions. Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger. Discrete & Computational Geometry (24): 721-733 (2000). Web SearchBibTeXDownload
75On R-trees with Low Stabbing Number. Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars. ESA 2000, 167-178. Web SearchBibTeXDownload
74Scalability and Efficiency of Genetic Algorithms for Geometrical Applications. Steven van Dijk, Dirk Thierens, Mark de Berg. PPSN 2000, 683-692. Web SearchBibTeXDownload
1999
73Motion Planning for Multiple Robots. Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels. Discrete & Computational Geometry (22): 505-525 (1999). Web SearchBibTeXDownload
72On The Design of Genetic Algorithms for Geographical Applications. Steven van Dijk, Dirk Thierens, Mark de Berg. GECCO 1999, 188-195. Web SearchBibTeX
71Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems. Paolo Ferragina, S. Muthukrishnan, Mark de Berg. STOC 1999, 483-491. Cited by 20Web SearchBibTeXDownload
70Spanning Trees Crossing Few Barriers. Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki. Symposium on Computational Geometry 1999, 41-48. Web SearchBibTeXDownload
69Lower Bounds for Kinetic Planar Subdivisions. Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger. Symposium on Computational Geometry 1999, 247-254. Web SearchBibTeXDownload
1998
68Guarding Scenes against Invasive Hypercubes. Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels. Algorithm Engineering 1998, 110-120. Web SearchBibTeX
67Recovering lines with fixed linear probes. Mark de Berg, Prosenjit Bose, David Bremner, William S. Evans, Lata Narayanan. CCCG 1998. Web SearchBibTeXDownload
66Computing constrained minimum-width annuli of point sets. Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong. Computer-Aided Design (30): 267-275 (1998). Web SearchBibTeXDownload
65The union of moving polygonal pseudodiscs - Combinatorial bounds and applications. Mark de Berg, Hazel Everett, Leonidas J. Guibas. Comput. Geom. (11): 69-81 (1998). Web SearchBibTeXDownload
64Motion Planning in Environments with Low Obstacle Density. A. Frank van der Stappen, Mark H. Overmars, Mark de Berg, Jules Vleugels. Discrete & Computational Geometry (20): 561-587 (1998). Web SearchBibTeXDownload
63On Levels of Detail in Terrains. Mark de Berg, Katrin Dobrindt. Graphical Models and Image Processing (60): 1-12 (1998). Web SearchBibTeXDownload
62Computing the Angularity Tolerance. Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong. Int. J. Comput. Geometry Appl. (8): 467-482 (1998). Web SearchBibTeXDownload
61Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf. SIAM J. Comput. (27): 654-667 (1998). Web SearchBibTeXDownload
60Models and Motion Planning. Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels. SWAT 1998, 83-94. Web SearchBibTeXDownload
59Motion Planning for Multiple Robots. Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels. Symposium on Computational Geometry 1998, 374-382. Web SearchBibTeXDownload
58Computing the Maximum Overlap of Two Convex Polygons under Translations. Mark de Berg, Otfried Cheong, Olivier Devillers, Marc J. van Kreveld, Monique Teillaud. Theory Comput. Syst. (31): 613-628 (1998). Web SearchBibTeXDownload
1997
57Trekking in the Alps Without Freezing or Getting Tired. Mark de Berg, Marc J. van Kreveld. Algorithmica (18): 306-323 (1997). Web SearchBibTeXDownload
56New Results on Binary Space Partitions in the Plane. Mark de Berg, Marko de Groot, Mark H. Overmars. Comput. Geom. (8): 317-333 (1997). Web SearchBibTeXDownload
55Perfect Binary Space Partitions. Mark de Berg, Marko de Groot, Mark H. Overmars. Comput. Geom. (7): 81-91 (1997). Web SearchBibTeXDownload
54Trends and Developments in Computational Geometry. Mark de Berg. Comput. Graph. Forum (16): 3-30 (1997). Web SearchBibTeXDownload
53Computing a Single Cell in the Overlay of Two Simple Polygons. Mark de Berg, Olivier Devillers, Katrin Dobrindt, Otfried Schwarzkopf. Inf. Process. Lett. (63): 215-219 (1997). Web SearchBibTeXDownload
52Simple Traversal of a Subdivision Without Extra Storage. Mark de Berg, Marc J. van Kreveld, René van Oostrum, Mark H. Overmars. International Journal of Geographical Information Science (11): 359-373 (1997). Web SearchBibTeXDownload
51Sparse Arrangements and the Number of Views of Polyhedral Scenes. Mark de Berg, Dan Halperin, Mark H. Overmars, Marc J. van Kreveld. Int. J. Comput. Geometry Appl. (7): 175-195 (1997). Web SearchBibTeXDownload
50Separating an Object from its Cast. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf. Symposium on Computational Geometry 1997, 221-230. Web SearchBibTeXDownload
49Realistic Input Models for Geometric Algorithms. Mark de Berg, Matthew J. Katz, Jules Vleugels, Jules Vleugels. Symposium on Computational Geometry 1997, 294-303. Web SearchBibTeXDownload
48Computing Constrained Minimum-Width Annuli of Point Sets. Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong. WADS 1997, 392-401. Web SearchBibTeXDownload
1996
47Visualization of TINs. Mark de Berg. Algorithmic Foundations of Geographic Information Systems 1996, 79-97. Web SearchBibTeXDownload
46The Complexity of Rivers in Triangulated Terrains. Mark de Berg, Prosenjit Bose, Katrin Dobrindt, Marc J. van Kreveld, Mark H. Overmars, Marko de Groot, Thomas Roos, Jack Snoeyink, Sidi Yu. CCCG 1996, 325-330. Web SearchBibTeX
45Computing the Angularity Tolerance. Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong. CCCG 1996, 331-336. Web SearchBibTeX
44Computing Half-plane and Strip Discrepancy of Planar Point Sets. Mark de Berg. Comput. Geom. (6): 69-83 (1996). Web SearchBibTeXDownload
43Point Location in Zones of K-flats in Arrangements. Mark de Berg, Marc J. van Kreveld, Otfried Schwarzkopf, Jack Snoeyink. Comput. Geom. (6): 131-143 (1996). Web SearchBibTeXDownload
42Vertical Decompositions for Triangles in 3-Space. Mark de Berg, Leonidas J. Guibas, Dan Halperin. Discrete & Computational Geometry (15): 35-61 (1996). Web SearchBibTeXDownload
41Computing the Maximum Overlap of Two Convex Polygons Under Translations. Mark de Berg, Olivier Devillers, Marc J. van Kreveld, Otfried Schwarzkopf, Monique Teillaud. ISAAC 1996, 126-135. Web SearchBibTeXDownload
40Efficient Generation of k-Directional Assembly Sequences. Pankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir. SODA 1996, 122-131. Web SearchBibTeXDownload
39Simple Traversal of a Subdivision Without Extra Storage. Mark de Berg, Marc J. van Kreveld, René van Oostrum, Mark H. Overmars. Symposium on Computational Geometry 1996, C-5-C-6. Web SearchBibTeXDownload
1995
38Simple Traversal of a Subdivision Without Extra Storage. Mark de Berg, Marc J. van Kreveld, René van Oostrum, Mark H. Overmars. ACM-GIS 1995, 77. Web SearchBibTeX
37Generalized Hidden Surface Removal. Mark de Berg. Comput. Geom. (5): 249-276 (1995). Web SearchBibTeXDownload
36Piecewise Linear Paths Among Convex Obstacles. Mark de Berg, Jirí Matousek, Otfried Schwarzkopf. Discrete & Computational Geometry (14): 9-29 (1995). Web SearchBibTeXDownload
35On Lazy Randomized Incremental Construction. Mark de Berg, Katrin Dobrindt, Otfried Schwarzkopf. Discrete & Computational Geometry (14): 261-286 (1995). Web SearchBibTeXDownload
34Linear Size Binary Space Partitions for Fat Objects. Mark de Berg. ESA 1995, 252-263. Web SearchBibTeXDownload
33Translation queries for sets of polygons. Mark de Berg, Hazel Everett, Hubert Wagener. Int. J. Comput. Geometry Appl. (5): 221-242 (1995). Web SearchBibTeXDownload
32Cuttings and applications. Mark de Berg, Otfried Schwarzkopf. Int. J. Comput. Geometry Appl. (5): 343-355 (1995). Web SearchBibTeXDownload
31Two- and Three-Dimensional Point Location in Rectangular Subdivisions. Mark de Berg, Marc J. van Kreveld, Jack Snoeyink. J. Algorithms (18): 256-277 (1995). Web SearchBibTeXDownload
30On Levels of Detail in Terrains. Mark de Berg, Katrin Dobrindt. Symposium on Computational Geometry 1995, C26-C27. Web SearchBibTeXDownload
29Reaching a Goal with Directional Uncertainty. Mark de Berg, Mark H. Overmars, Dan Halperin, Mark H. Overmars, Monique Teillaud, Micha Sharir, Micha Sharir. Theor. Comput. Sci. (140): 301-317 (1995). Web SearchBibTeXDownload
1994
28Efficient Ray Shooting and Hidden Surface Removal. Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld. Algorithmica (12): 30-53 (1994). Web SearchBibTeXDownload
27Rectilinear Decompositions with Low Stabbing Number. Mark de Berg, Marc J. van Kreveld. Inf. Process. Lett. (52): 215-221 (1994). Web SearchBibTeXDownload
26Computing and Verifying Depth Orders. Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf. SIAM J. Comput. (23): 437-446 (1994). Web SearchBibTeXDownload
25On lazy randomized incremental construction. Mark de Berg, Katrin Dobrindt, Otfried Schwarzkopf. STOC 1994, 105-114. Web SearchBibTeXDownload
24New Results on Binary Space Partitions in the Plane (Extended Abstract). Mark de Berg, Marko de Groot, Mark H. Overmars. SWAT 1994, 61-72. Web SearchBibTeXDownload
23Vertical Decompositions for Triangles in 3-Space. Mark de Berg, Leonidas J. Guibas, Dan Halperin. Symposium on Computational Geometry 1994, 1-10. Web SearchBibTeXDownload
22Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf. Symposium on Computational Geometry 1994, 67-75. Web SearchBibTeXDownload
1993
21Perfect Binary Space Partitions. Mark de Berg, Marko de Groot, Mark H. Overmars. CCCG 1993, 109-114. Web SearchBibTeX
20Trekking in the Alps Without Freezing or Getting Tired. Mark de Berg, Marc J. van Kreveld. ESA 1993, 121-132. Web SearchBibTeXDownload
19Reaching a Goal with Directional Uncertainty. Mark de Berg, Mark H. Overmars, Dan Halperin, Mark H. Overmars, Monique Teillaud, Micha Sharir, Micha Sharir. ISAAC 1993, 1-10. Web SearchBibTeXDownload
18Piecewise linear paths among convex obstacles. Mark de Berg, Jirí Matousek, Otfried Schwarzkopf. STOC 1993, 505-514. Web SearchBibTeXDownload
17Generalized Hidden Surface Removal. Mark de Berg. Symposium on Computational Geometry 1993, 1-10. Web SearchBibTeXDownload
1992
16Dynamic Output-sensitive Hidden Surface Removal for C-oriented Polyhedra. Mark de Berg. Comput. Geom. (2): 119-140 (1992). Web SearchBibTeXDownload
15Shortest path queries in rectilinear worlds. Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars. Int. J. Comput. Geometry Appl. (2): 287-309 (1992). Web SearchBibTeXDownload
14A General Approach to Dominance in the Plane. Mark de Berg, Svante Carlsson, Mark H. Overmars. J. Algorithms (13): 274-296 (1992). Web SearchBibTeXDownload
13Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract). Mark de Berg, Marc J. van Kreveld, Jack Snoeyink. SWAT 1992, 352-363. Web SearchBibTeXDownload
12Computing and Verifying Depth Orders. Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf. Symposium on Computational Geometry 1992, 138-145. Web SearchBibTeXDownload
1991
11Finding Squares and Rectangles in Sets of Points. Marc J. van Kreveld, Mark de Berg. BIT (31): 202-219 (1991). Web SearchBibTeX
10Hidden Surface Removal for C-oriented Polyhedra. Mark de Berg, Mark H. Overmars. Comput. Geom. (1): 247-268 (1991). Web SearchBibTeXDownload
9On Rectilinear Link Distance. Mark de Berg. Comput. Geom. (1): 13-34 (1991). Web SearchBibTeXDownload
8Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract). Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson. Symposium on Computational Geometry 1991, 51-60. Web SearchBibTeXDownload
7Efficient Ray Shooting and Hidden Surface Removal. Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld. Symposium on Computational Geometry 1991, 21-30. Web SearchBibTeXDownload
1990
6Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract). Mark de Berg, Mark H. Overmars. FOCS 1990, 252-261. Web SearchBibTeXDownload
5Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric. Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars. SWAT 1990, 213-224. Web SearchBibTeXDownload
4Translating Polygons with Applications to Hidden Surface Removal. Mark de Berg. SWAT 1990, 60-70. Web SearchBibTeXDownload
1989
3Maintaining Range Trees in Secondary Memory. Part I: Partitions. Mark H. Overmars, Michiel H. M. Smid, Mark de Berg, Marc J. van Kreveld. Acta Inf. (27): 423-452 (1989). Web SearchBibTeXDownload
2Finding Squares and Rectangles in Sets of Points. Marc J. van Kreveld, Mark de Berg. WG 1989, 341-355. Web SearchBibTeXDownload
1988
1Dominance in the Presence of Obstracles. Mark de Berg, Mark H. Overmars. WG 1988, 190-201. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research