Mark Overmars

10.2k total citations · 4 hit papers
48 papers, 6.2k citations indexed

About

Mark Overmars is a scholar working on Computer Graphics and Computer-Aided Design, Computer Vision and Pattern Recognition and Computational Mechanics. According to data from OpenAlex, Mark Overmars has authored 48 papers receiving a total of 6.2k indexed citations (citations by other indexed papers that have themselves been cited), including 33 papers in Computer Graphics and Computer-Aided Design, 21 papers in Computer Vision and Pattern Recognition and 10 papers in Computational Mechanics. Recurrent topics in Mark Overmars's work include Computational Geometry and Mesh Generation (33 papers), Robotic Path Planning Algorithms (12 papers) and Advanced Numerical Analysis Techniques (9 papers). Mark Overmars is often cited by papers focused on Computational Geometry and Mesh Generation (33 papers), Robotic Path Planning Algorithms (12 papers) and Advanced Numerical Analysis Techniques (9 papers). Mark Overmars collaborates with scholars based in Netherlands, United States and Canada. Mark Overmars's co-authors include Mark de Berg, Marc van Kreveld, Otfried Cheong, Otfried Schwarzkopf, Otfried Schwarzkopf, Jur van den Berg, Roland Gerærts, Jean‐Paul Laumond, Ioannis Karamouzas and Jules Vleugels and has published in prestigious journals such as The International Journal of Robotics Research, SIAM Journal on Computing and BIT Numerical Mathematics.

In The Last Decade

Mark Overmars

46 papers receiving 5.8k citations

Hit Papers

Computational Geometry: A... 1997 2026 2006 2016 1997 2008 2000 1997 500 1000 1.5k 2.0k 2.5k
What are hit papers?

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.

  1. Computational Geometry: Algorithms and Applications
    1997 3.0k citations Mark de Berg, Otfried Cheong et al. CERN Document Server (European Organization for Nuclear Research) profile →
  2. Computational Geometry
    2008 1.1k citations Mark de Berg, Otfried Cheong et al. profile →
  3. Computational Geometry
    2000 950 citations Mark de Berg, Marc van Kreveld et al. profile →
  4. Computational Geometry
    1997 490 citations Mark 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

Author Last Decade Papers Cites
Mark Overmars 2.1k 2.0k 1.2k 1.2k 822 48 6.2k
Mark de Berg 2.6k 1.3× 3.0k 1.5× 1.9k 1.6× 1.5k 1.2× 914 1.1× 204 7.8k
Otfried Cheong 1.4k 0.7× 1.6k 0.8× 974 0.8× 847 0.7× 576 0.7× 67 4.6k
Marc van Kreveld 2.7k 1.3× 2.7k 1.4× 2.4k 2.0× 1.4k 1.2× 808 1.0× 182 8.3k
David Kirkpatrick 1.5k 0.7× 1.9k 1.0× 734 0.6× 700 0.6× 517 0.6× 129 4.8k
Michael Ian Shamos 2.6k 1.3× 3.8k 2.0× 1.8k 1.5× 1.3k 1.1× 862 1.0× 18 8.3k
Pankaj K. Agarwal 2.3k 1.1× 3.6k 1.8× 2.2k 1.8× 1.3k 1.1× 457 0.6× 299 6.8k
Franz Aurenhammer 1.2k 0.6× 1.8k 0.9× 722 0.6× 698 0.6× 448 0.5× 105 4.8k
Kōkichi Sugihara 1.3k 0.6× 1.5k 0.8× 638 0.5× 625 0.5× 540 0.7× 153 5.8k
Mikhail J. Atallah 2.3k 1.1× 2.1k 1.1× 1.5k 1.2× 1.8k 1.5× 428 0.5× 235 8.6k
David Luebke 3.9k 1.9× 2.7k 1.4× 510 0.4× 1.5k 1.2× 416 0.5× 121 9.3k

Countries citing papers authored by Mark Overmars

Since Specialization
Citations

This map shows the geographic impact of Mark Overmars'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 Overmars with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mark Overmars more than expected).

Fields of papers citing papers by Mark Overmars

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Mark Overmars. 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 Overmars. The network helps show where Mark Overmars may publish in the future.

Co-authorship network of co-authors of Mark Overmars

This figure shows the co-authorship network connecting the top 25 collaborators of Mark Overmars. A scholar is included among the top collaborators of Mark Overmars 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 Overmars. Mark Overmars 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.
Aloupis, Greg, Prosenjit Bose, Erik D. Demaine, et al.. (2011). COMPUTING SIGNED PERMUTATIONS OF POLYGONS. International Journal of Computational Geometry & Applications. 21(1). 87–100.
2.
Berg, Jur van den & Mark Overmars. (2007). Kinodynamic motion planning on roadmaps in dynamic environments. 4253–4258. 34 indexed citations
3.
Nieuwenhuisen, Dennis, Jur van den Berg, & Mark Overmars. (2007). Efficient path planning in changing environments. 3295–3301. 9 indexed citations
4.
Berg, Mark de, Dan Halperin, & Mark Overmars. (2006). An intersection-sensitive algorithm for snap rounding. Computational Geometry. 36(3). 159–165. 21 indexed citations
5.
Demaine, Erik D., Jeff Erickson, Danny Kriz̧anc, et al.. (2006). Realizing partitions respecting full and partial order information. Journal of Discrete Algorithms. 6(1). 51–58. 1 indexed citations
6.
Gerærts, Roland & Mark Overmars. (2006). Creating High-quality Roadmaps for Motion Planning in Virtual Environments. 4355–4361. 38 indexed citations
7.
Agarwal, Pankaj K., Mark Overmars, & Micha Sharir. (2004). Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks. Symposium on Discrete Algorithms. 516–525. 1 indexed citations
8.
Berg, Mark de, et al.. (2003). Guarding scenes against invasive hypercubes. Computational Geometry. 26(2). 99–117. 14 indexed citations
9.
Aichholzer, Oswin, Erik D. Demaine, Jeff Erickson, et al.. (2001). Reconfiguring convex polygons. Computational Geometry. 20(1-2). 85–95. 10 indexed citations
10.
Aichholzer, Oswin, Erik D. Demaine, Vida Dujmović, et al.. (2000). Flipturning polygons. ArXiv.org. 1 indexed citations
11.
Vleugels, Jules & Mark Overmars. (1998). Approximating Voronoi Diagrams of Convex Sites in Any Dimension. International Journal of Computational Geometry & Applications. 8(2). 201–221. 24 indexed citations
12.
Laumond, Jean‐Paul & Mark Overmars. (1997). Algorithms for Robotic Motion and Manipulation. 32 indexed citations
13.
Berg, Mark de, et al.. (1997). New results on binary space partitions in the plane. Computational Geometry. 8(6). 317–333. 23 indexed citations
14.
Berg, Mark de, Dan Halperin, Mark Overmars, & Marc van Kreveld. (1997). Sparse Arrangements and the Number of Views of Polyhedral Scenes. International Journal of Computational Geometry & Applications. 7(3). 175–195. 17 indexed citations
15.
Berg, Mark de, Otfried Cheong, Marc van Kreveld, & Mark Overmars. (1997). Computational Geometry: Algorithms and Applications. CERN Document Server (European Organization for Nuclear Research). 2954 indexed citations breakdown →
16.
Berg, Mark de, et al.. (1996). Computing the Angularity Tolerance. TU/e Research Portal. 1 indexed citations
17.
Vleugels, Jules, et al.. (1996). Hunting Voronoi vertices. Computational Geometry. 6(5). 329–354. 5 indexed citations
18.
Overmars, Mark, et al.. (1995). Immobilizing polygons against a wall. 29–38. 14 indexed citations
19.
Berg, Mark de, Leonidas Guibas, Dan Halperin, et al.. (1994). Reaching a goal with directional uncertainty. TU/e Research Portal. 4 indexed citations
20.
Berg, Mark de, Marc van Kreveld, Bengt J. Nilsson, & Mark Overmars. (1992). SHORTEST PATH QUERIES IN RECTILINEAR WORLDS. International Journal of Computational Geometry & Applications. 2(3). 287–309. 14 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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Mark de Berg Breakdown of academic impact, for papers by Otfried Cheong Breakdown of academic impact, for papers by Marc van Kreveld Breakdown of academic impact, for papers by David Kirkpatrick Breakdown of academic impact, for papers by Michael Ian Shamos Breakdown of academic impact, for papers by Pankaj K. Agarwal Breakdown of academic impact, for papers by Franz Aurenhammer Breakdown of academic impact, for papers by Kōkichi Sugihara Breakdown of academic impact, for papers by Mikhail J. Atallah Breakdown of academic impact, for papers by David Luebke
Rankless by CCL
2026