Marc van Kreveld
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Marc van Kreveld has a total of 157 co-authors. Here are the top co-authors by number of shared publications:
- Bettina Speckmann
Eindhoven University of Technology
8 shared publications - Maarten Löffler
Utrecht University
5 shared publications - Mark de Berg
Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands
5 shared publications - Rodrigo I. Silveira
Departament de Matemàtiques, Universitat Politècnica de Catalunya, Barcelona, Spain
5 shared publications Maarten Löffler
Dept. of Information and Computing Sciences, Utrecht University, The Netherlands
4 shared publications- Mark Overmars
Utrecht University
4 shared publications
Latest Publications
- Open Access
- 19 June 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1082
Collision detection for modular robots – it is easy to cause collisions and hard to avoid them
- 19 June 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1082
Open AccessCollision detection for modular robots – it is easy to cause collisions and hard to avoid them
- 14 February 2026
- Published by Springer Nature
- p. 33-48
Minimizing Vertical Length in Linked Bar Charts
- Open Access
Minimum spanning blob-trees
We investigate blob-trees, a new way of connecting a set of points, by a mixture of enclosing them by cycles (as in the convex hull) and connecting them by edges (as in a spanning tree). We show that a minimum-cost blob-tree for $n$ points can be computed in $O(n^3)$ time.Open AccessMinimum spanning blob-trees
We investigate blob-trees, a new way of connecting a set of points, by a mixture of enclosing them by cycles (as in the convex hull) and connecting them by edges (as in a spanning tree). We show that a minimum-cost blob-tree for $n$ points can be computed in $O(n^3)$ time. - 27 December 2024
- Published by Springer Nature
- p. 76-90
Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them
- 27 December 2024
- Published by Springer Nature
- p. 76-90
Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them
- Open Access
- 30 June 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Spatial Algorithms and Systems
- Vol. 10 (2) , 1-35
Mobility Data Science: Perspectives and Challenges
Mobility data captures the locations of moving objects such as humans, animals, and cars. With the availability of Global Positioning System (GPS)–equipped mobile devices and other inexpensive location-tracking technologies, mobility data is collected ubiquitously. In recent years, the use of mobility data has demonstrated a significant impact in various domains, including traffic management, urban planning, and health sciences. In this article, we present the domain of mobility data science. Towards a unified approach to mobility data science, we present a pipeline having the following components: mobility data collection, cleaning, analysis, management, and privacy. For each of these components, we explain how mobility data science differs from general data science, we survey the current state-of-the-art, and describe open challenges for the research community in the coming years.
- 30 June 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Spatial Algorithms and Systems
- Vol. 10 (2) , 1-35
Open AccessMobility Data Science: Perspectives and Challenges
Mobility data captures the locations of moving objects such as humans, animals, and cars. With the availability of Global Positioning System (GPS)–equipped mobile devices and other inexpensive location-tracking technologies, mobility data is collected ubiquitously. In recent years, the use of mobility data has demonstrated a significant impact in various domains, including traffic management, urban planning, and health sciences. In this article, we present the domain of mobility data science. Towards a unified approach to mobility data science, we present a pipeline having the following components: mobility data collection, cleaning, analysis, management, and privacy. For each of these components, we explain how mobility data science differs from general data science, we survey the current state-of-the-art, and describe open challenges for the research community in the coming years.
- Open Access
Reconstructing Graphs from Connected Triples
We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set of connected triples, making unique reconstruction of the original graph from the triples impossible. We identify some families of graphs (including triangle-free graphs) for which all graphs have a different set of connected triples. We also give algorithms that reconstruct a graph from a set of triples, and for testing if this reconstruction is unique. Finally, we study a possible extension of the model in which the subsets of size $k$ that induce a connected graph are given for larger (fixed) values of $k$.Open AccessReconstructing Graphs from Connected Triples
We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set of connected triples, making unique reconstruction of the original graph from the triples impossible. We identify some families of graphs (including triangle-free graphs) for which all graphs have a different set of connected triples. We also give algorithms that reconstruct a graph from a set of triples, and for testing if this reconstruction is unique. Finally, we study a possible extension of the model in which the subsets of size $k$ that induce a connected graph are given for larger (fixed) values of $k$. - 1 October 2022
- Published by Springer Nature
- p. 328-341
On Fully Diverse Sets of Geometric Objects and Graphs
- 1 October 2022
- Published by Springer Nature
- p. 328-341
On Fully Diverse Sets of Geometric Objects and Graphs
- 27 July 2022
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 69 (4) , 1157-1194
Space-Aware Reconfiguration
- 27 July 2022
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 69 (4) , 1157-1194
Space-Aware Reconfiguration
- Open Access
- 1 January 2022
- Published by Elsevier in Computational Geometry
- Vol. 100
Between shapes, using the Hausdorff distance
- 1 January 2022
- Published by Elsevier in Computational Geometry
- Vol. 100
Open AccessBetween shapes, using the Hausdorff distance