Mark de Berg
Mark de Berg
Professor of Computer Science, TU Eindhoven
Verified email at
Cited by
Cited by
Computational Geometry: Algorithms and Applications
M de Berg, O Cheong, M van Kreveld, M Overmars
Springer Berlin Heidelberg, 2008
The priority R-tree: A practically efficient and worst-case optimal R-tree
L Arge, M de Berg, H Haverkort, K Yi
ACM Transactions on Algorithms (TALG) 4 (1), 9, 2008
On levels of detail in terrains
M De Berg, K Dobrindt
Graphical Models and Image Processing 60, 1-12, 1998
Realistic input models for geometric algorithms
M de Berg, MJ Katz, AF van der Stappen, J Vleugels
Algorithmica 34 (1), 81-97, 2002
Topologically correct subdivision simplification using the bandwidth criterion
M de Berg, M van Kreveld, S Schirra
Cartography and Geographic Information Systems 25 (4), 243-257, 1998
Optimal binary space partitions for segments in the plane
M de Berg, A Khosravi
International Journal of Computational Geometry & Applications 22 (03), 187-205, 2012
Constructing levels in arrangements and higher order Voronoi diagrams
PK Agarwal, M de Berg, J Matousek, O Schwarzkopf
SIAM journal on computing 27 (3), 654-667, 1998
Ray shooting, depth orders and hidden surface removal
M de Berg
Lecture Notes in Computer Science 703, Springer, 1993
TSP with neighborhoods of varying size
M De Berg, J Gudmundsson, MJ Katz, C Levcopoulos, MH Overmars, ...
Journal of Algorithms 57 (1), 22-36, 2005
Efficient ray shooting and hidden surface removal
M de Berg, D Halperin, M Overmars, J Snoeyink, M van Kreveld
Algorithmica 12 (1), 30-53, 1994
Trekking in the Alps without freezing or getting tired
M de Berg, M van Kreveld
Algorithmica 18 (3), 306-323, 1997
Schematization of networks
S Cabello, M de Berg, M van Kreveld
Computational Geometry 30 (3), 223-238, 2005
On lazy randomized incremental construction
M de Berg, K Dobrindt, O Schwarzkopf
Discrete & Computational Geometry 14 (3), 261-286, 1995
Box-trees and R-trees with near-optimal query time
A Agarwal, M de Berg, J Gudmundsson, M Hammar, HJ Haverkort
Discrete & Computational Geometry 28 (3), 291-312, 2002
Faster DBscan and HDBScan in Low-Dimensional Euclidean Spaces
M de Berg, A Gunawan, M Roeloffzen
Int. J. Comput. Geom. Appl. 29, 21-47, 2019
Shortest path queries in rectilinear worlds
M de Berg, M van Kreveld, BJ Nilsson, M Overmars
International Journal of Computational Geometry & Applications 2 (3), 287-309, 1992
Vertical decompositions for triangles in 3-space
M de Berg, LJ Guibas, D Halperin
Discrete & Computational Geometry 15 (1), 35-61, 1996
On rectilinear link distance
M de Berg
Computational Geometry 1 (1), 13-34, 1991
Motion planning for multiple robots
B Aronov, M de Berg, AF van der Stappen, P Švestka, J Vleugels
Proceedings of the fourteenth annual symposium on Computational geometry …, 1998
Efficient multi-robot motion planning for unlabeled discs in simple polygons
A Adler, M De Berg, D Halperin, K Solovey
Algorithmic Foundations of Robotics XI: Selected Contributions of the …, 2015
The system can't perform the operation now. Try again later.
Articles 1–20