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.
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
This map shows the geographic impact of M.H. 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 M.H. Overmars with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites M.H. Overmars more than expected).
This network shows the impact of papers produced by M.H. 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 M.H. Overmars. The network helps show where M.H. Overmars may publish in the future.
Co-authorship network of co-authors of M.H. Overmars
This figure shows the co-authorship network connecting the top 25 collaborators of M.H. Overmars.
A scholar is included among the top collaborators of M.H. 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 M.H. Overmars. M.H. Overmars is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Gerærts, Roland & M.H. Overmars. (2008). Enhancing Corridor Maps for Real-Time Path Planning in Virtual Environments. Utrecht University Repository (Utrecht University). 64–71.12 indexed citations
3.
Gerærts, Roland & M.H. Overmars. (2005). Creating small roadmaps for solving motion planning problems. Data Archiving and Networked Services (DANS). 531–536.12 indexed citations
Nieuwenhuisen, Dennis, et al.. (2004). Automatic Construction of High Quality Roadmaps for Path Planning. Utrecht University Repository (Utrecht University).2 indexed citations
6.
Gerærts, Roland & M.H. Overmars. (2004). Sampling Techniques for Probabilistic Roadmap Planners. Data Archiving and Networked Services (DANS). 600–609.27 indexed citations
7.
Knobbe, Arno, Joost N. Kok, & M.H. Overmars. (1995). Robot Motion Planning in Unknown Environments Using Neural Networks. Utrecht University Repository (Utrecht University).4 indexed citations
8.
Vleugels, Jules & M.H. Overmars. (1995). Approximating generalized Voronoi diagrams in any dimension. Data Archiving and Networked Services (DANS).41 indexed citations
Vleugels, Jules, Joost N. Kok, & M.H. Overmars. (1993). Motion planning using a colored Kohonen network. Utrecht University Repository (Utrecht University).6 indexed citations
11.
Overmars, M.H.. (1992). A random approach to motion planning. Utrecht University Repository (Utrecht University).58 indexed citations
12.
Berg, Mark de & M.H. Overmars. (1990). Hidden surface removal for axis-parallel polyhedra (extended abstract). 252–261.3 indexed citations
13.
Torenvliet, Leen, et al.. (1989). Two models for the reconstruction problem for dynamic data structures. Journal of automata, languages and combinatorics. 25(4). 131–155.2 indexed citations
14.
Overmars, M.H.. (1988). Sets without empty convex 6-gons. Data Archiving and Networked Services (DANS). 37. 160–167.12 indexed citations
15.
Overmars, M.H.. (1988). New upper bounds in Klee's measure problem* (extended abstract). Data Archiving and Networked Services (DANS). 550–556.1 indexed citations
16.
Overmars, M.H.. (1987). Construction of sparse visibility graphs. Data Archiving and Networked Services (DANS).8 indexed citations
17.
Overmars, M.H.. (1985). Range searching on a grid. Data Archiving and Networked Services (DANS).10 indexed citations
18.
Overmars, M.H.. (1985). The complexity of cutting paper. Data Archiving and Networked Services (DANS).12 indexed citations
19.
Overmars, M.H.. (1981). On the equivalence of rectangle containment, rectangle enclosure and ECDF-searching. Data Archiving and Networked Services (DANS).3 indexed citations
20.
Overmars, M.H.. (1981). Searching in the past I. Data Archiving and Networked Services (DANS).11 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.