RESEARCHER PROFILE
Mark de Berg
← Back to Eindhoven University of Technology
M
Eindhoven University of Technology
Mark de Berg works in Computational Geometry and Mesh Generation, Complexity and Algorithms in Graphs, Advanced Combinatorial Mathematics, Computer Graphics and Visualization Techniques, Data Management and Algorithms. Recorded institutional associations include Eindhoven University of Technology.
639Publications
14,225Citations
41H-index
Inclusion identifies researchers whose recorded research contributions may inform their university’s understanding of its research community. It does not rank individual research quality or establish current employment.
Selected research works
Up to 100 highly cited works; DOI links open the original research. Counts reflect the collected record, not real-time citation totals.
Computational Geometry: Algorithms and Applications
1997 · 4,449 citationsComputational Geometry
2008 · 1,999 citationsComputational Geometry
2000 · 1,473 citationsComputational Geometry
1997 · 800 citationsComputational Geometry: Algorithms and Applications, Second Edition
2000 · 276 citationsRealistic Input Models for Geometric Algorithms
2002 · 136 citationsThe priority R-tree
2008 · 119 citationsThe Priority R-tree
2004 · 115 citationsTSP with neighborhoods of varying size
2005 · 108 citationsConstructing Levels in Arrangements and Higher Order Voronoi Diagrams
1998 · 108 citationsOPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
2012 · 103 citationsOn levels of detail in terrains
1995 · 96 citationsAlgorithm Theory - SWAT 2004
2004 · 86 citationsTrekking in the Alps Without Freezing or Getting Tired
1997 · 77 citationsComputational Geometry
1997 · 76 citationsOn lazy randomized incremental construction
1995 · 74 citationsRay Shooting, Depth Orders and Hidden Surface Removal
1993 · 72 citationsComputational Geometry
2008 · 71 citationsLinear Size Binary Space Partitions for Uncluttered Scenes
2000 · 69 citationsAlgorithms - ESA 2010
2011 · 66 citationsRealistic input models for geometric algorithms
1997 · 66 citationsTopologically Correct Subdivision Simplification Using the Bandwidth Criterion
1998 · 64 citationsCUTTINGS AND APPLICATIONS
1995 · 62 citationsBox-Trees and R-Trees with Near-Optimal Query Time
2002 · 60 citationsComputing the Maximum Overlap of Two Convex Polygons Under Translations
1996 · 58 citations
