Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Computational Geometry: Algorithms and Applications
19973.0k citationsMark de Berg, Otfried Cheong et al.profile →
Computational Geometry
20081.1k citationsMark de Berg, Otfried Cheong et al.profile →
Computational Geometry
2000950 citationsMark de Berg, Marc van Kreveld et al.profile →
Computational Geometry
1997490 citationsMark de Berg, Marc van Kreveld et al.profile →
Author Peers
Peers are selected by citation overlap in the author's most active subfields.
citations ·
hero ref
This map shows the geographic impact of Mark de Berg's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Mark de Berg with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mark de Berg more than expected).
This network shows the impact of papers produced by Mark de Berg. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Mark de Berg. The network helps show where Mark de Berg may publish in the future.
Co-authorship network of co-authors of Mark de Berg
This figure shows the co-authorship network connecting the top 25 collaborators of Mark de Berg.
A scholar is included among the top collaborators of Mark de Berg based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Mark de Berg. Mark de Berg is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Berg, Mark de, et al.. (2019). On One-Round Discrete Voronoi Games. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).2 indexed citations
2.
Berg, Mark de, et al.. (2018). SZTAKI Publication Repository (Hungarian Academy of Sciences).11 indexed citations
Aronov, Boris, et al.. (2008). Cutting cycles of rods in space: hardness and approximation. Symposium on Discrete Algorithms. 1241–1248.4 indexed citations
Agarwal, Pankaj K., Mark de Berg, Jie Gao, Leonidas Guibas, & Sariel Har-Peled. (2005). Staying in the middle : exact and approximate medians in R1 and R2 for moving points. TU/e Research Portal. 33(1). 43–46.11 indexed citations
12.
Berg, Mark de, et al.. (2004). Approximate range searching using binary space partitions. 433.3 indexed citations
Berg, Mark de, Prosenjit Bose, Marc van Kreveld, et al.. (1996). The Complexity of Rivers in Triangulated Terrains. Canadian Conference on Computational Geometry. 325–330.11 indexed citations
Berg, Mark de, et al.. (1993). Perfect Binary Space Partitions.. Canadian Conference on Computational Geometry. 109–114.3 indexed citations
19.
Berg, Mark de & M.H. Overmars. (1990). Hidden surface removal for axis-parallel polyhedra (extended abstract). 252–261.3 indexed citations
20.
Berg, Mark de, M.H. Overmars, & Marc van Kreveld. (1989). Finding complete bipartite subgraphs in bipartite graphs. 1. 79–86.3 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.