Marc Van Kreveld

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Computing largest subsets of points whose convex hulls have bounded area and diameter2026-08-31Paper
The geodesic Fréchet distance between two curves bounding a simple polygon2026-08-31Paper
Collision detection for modular robots -- it is easy to cause collisions and hard to avoid them
Theoretical Computer Science
2026-08-21Paper
A near-linear time exact algorithm for the L₁-Geodesic Fréchet distance between two curves on the boundary of a simple polygon2026-08-11Paper
Robust classification of dynamic bichromatic point sets in \(\mathbb{R}^2\)2026-06-08Paper
Capturing the shape of a point set with a line segment2026-05-12Paper
Faster Fréchet distance approximation through truncated smoothing
Journal of Computational Geometry
2025-11-10Paper
Abstract morphing using the Hausdorff distance and Voronoi diagrams2025-06-19Paper
The complexity of geodesic spanners
Journal of Computational Geometry
2024-10-18Paper
The complexity of geodesic spanners2024-10-16Paper
A subquadratic \(n^\varepsilon\)-approximation for the continuous Fréchet distance2024-05-14Paper
scientific article; zbMATH DE number 7765371 (Why is no real title available?)2023-11-14Paper
scientific article; zbMATH DE number 7765391 (Why is no real title available?)
(available as arXiv preprint)
2023-11-14Paper
The Spiroplot App (Media Exposition)2023-11-02Paper
Space-aware reconfiguration
Discrete & Computational Geometry
2023-05-12Paper
On fully diverse sets of geometric objects and graphs
Graph-Theoretic Concepts in Computer Science
2023-05-05Paper
Reconstructing Graphs from Connected Triples2023-03-12Paper
Computing the maximum overlap of two convex polygons under translations2023-01-25Paper
Connected component and simple polygon intersection searching
Lecture Notes in Computer Science
2023-01-18Paper
Filling polyhedral molds
Lecture Notes in Computer Science
2023-01-18Paper
On fat partitioning, fat covering and the union size of polygons
Lecture Notes in Computer Science
2023-01-18Paper
Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
SWAT 90
2022-12-09Paper
Intersection queries in sets of disks
SWAT 90
2022-12-09Paper
Two- and three- dimensional point location in rectangular subdivisions
Algorithm Theory — SWAT '92
2022-12-09Paper
Concatenable segment trees (extended abstract)
STACS 89
2022-08-16Paper
Competitive Searching for a Line on a Line Arrangement.2022-07-21Paper
Convex partial transversals of planar regions
(available as arXiv preprint)
2022-07-21Paper
Mapping multiple regions to the grid with bounded Hausdorff distance2022-03-25Paper
Diverse partitions of colored points2022-03-25Paper
10 reasons to get interested in graph drawing2022-02-16Paper
Linear-time reconstruction of Delaunay triangulations with applications2021-12-20Paper
Between shapes, using the Hausdorff distance
Computational Geometry
2021-12-15Paper
Space-aware reconfiguration
Algorithmic Foundations of Robotics XIV
2021-09-20Paper
Topological stability of kinetic \(k\)-centers
Theoretical Computer Science
2021-04-14Paper
On optimal polyline simplification using the Hausdorff and Fréchet distance2020-08-18Paper
On optimal polyline simplification using the Hausdorff and Fréchet distance
(available as arXiv preprint)
2020-08-04Paper
Computing optimal homotopies over a spiked plane with polygonal boundary2020-05-27Paper
Computing representative networks for braided rivers2020-01-13Paper
Topological stability of kinetic \(k\)-centers
WALCOM: Algorithms and Computation
2019-10-15Paper
Geometry and generation of a new graph planarity game
Journal of Graph Algorithms and Applications
2019-09-16Paper
Segmentation of trajectories on non-monotone criteria
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-05-15Paper
The painter's problem: covering a grid with colored connected polygons
Lecture Notes in Computer Science
2019-02-20Paper
Segmentation of trajectories on nonmonotone criteria
ACM Transactions on Algorithms
2018-10-30Paper
scientific article; zbMATH DE number 6917067 (Why is no real title available?)2018-08-13Paper
A refined definition for groups of moving entities and its computation
International Journal of Computational Geometry & Applications
2018-08-02Paper
Central trajectories
(available as arXiv preprint)
2018-06-05Paper
A refined definition for groups of moving entities and its computation2018-04-19Paper
Mapping polygons to the grid with small Hausdorff and Fréchet distance
(available as arXiv preprint)
2018-03-02Paper
Colored spanning graphs for set visualization
Computational Geometry
2018-02-19Paper
Colored spanning graphs for set visualization
Computational Geometry
2018-02-19Paper
Grouping time-varying data for interactive exploration
(available as arXiv preprint)
2018-01-30Paper
The explicit corridor map: using the medial axis for real-time path planning and crowd simulation2018-01-30Paper
Embedding rivers in polyhedral terrains
Proceedings of the twenty-fifth annual symposium on Computational geometry
2017-10-20Paper
Trajectory grouping structure under geodesic distance2017-10-10Paper
Schematization of road networks
Proceedings of the seventeenth annual symposium on Computational geometry
2017-09-29Paper
Approximation algorithms for aligning points
Proceedings of the nineteenth annual symposium on Computational geometry
2017-09-29Paper
Good NEWS: partitioning a simple polygon by compass directions
Proceedings of the nineteenth annual symposium on Computational geometry
2017-09-29Paper
Packing plane spanning trees and paths in complete geometric graphs
Information Processing Letters
2017-06-13Paper
Trajectory grouping structure2017-03-30Paper
Labeling a rectilinear map more efficiently
Information Processing Letters
2016-06-16Paper
Improved Grid Map Layout by Point Set Matching
International Journal of Computational Geometry & Applications
2015-11-03Paper
Google Scholar makes it hard -- the complexity of organizing one's publications
Information Processing Letters
2015-09-15Paper
Google Scholar makes it hard -- the complexity of organizing one's publications
Information Processing Letters
2015-09-15Paper
Computing similarity between piecewise-linear functions
Proceedings of the twenty-sixth annual symposium on Computational geometry
2014-04-03Paper
Computing correlation between piecewise-linear functions
SIAM Journal on Computing
2014-02-04Paper
Colored spanning graphs for set visualization
Graph Drawing
2013-12-20Paper
On planar supports for hypergraphs
Journal of Graph Algorithms and Applications
2013-11-28Paper
Trajectory grouping structure
Lecture Notes in Computer Science
2013-08-12Paper
Median trajectories
Algorithmica
2013-06-25Paper
Time-space maps from triangulations
Graph Drawing
2013-04-03Paper
How many potatoes are in a mesh?
Algorithms and Computation
2013-03-21Paper
Blocking Delaunay triangulations
Computational Geometry
2012-12-04Paper
Geodesic disks and clustering in a simple polygon
International Journal of Computational Geometry & Applications
2012-11-23Paper
Empty pseudo-triangles in point sets
Discrete Applied Mathematics
2012-03-19Paper
Finding long and similar parts of trajectories
Computational Geometry
2011-12-28Paper
Bold graph drawings
Computational Geometry
2011-12-28Paper
Peeling meshed potatoes
Algorithmica
2011-05-10Paper
Geometric simultaneous embeddings of a graph and a matching
Journal of Graph Algorithms and Applications
2011-04-19Paper
Preprocessing Imprecise Points and Splitting Triangulations
SIAM Journal on Computing
2011-04-04Paper
The quality ratio of RAC drawings and planar drawings of planar graphs
Graph Drawing
2011-02-11Paper
Algorithmic aspects of proportional symbol maps
Algorithmica
2010-09-27Paper
Median trajectories
Algorithms – ESA 2010
2010-09-06Paper
Geometric simultaneous embeddings of a graph and a matching
Graph Drawing
2010-04-27Paper
On planar supports for hypergraphs
Graph Drawing
2010-04-27Paper
Optimization for first order Delaunay triangulations
Computational Geometry
2010-03-16Paper
Largest bounding box, smallest diameter, and related problems on imprecise points
Computational Geometry
2010-03-16Paper
Largest and smallest convex hulls for imprecise points
Algorithmica
2010-02-23Paper
Matched drawings of planar graphs
Journal of Graph Algorithms and Applications
2010-02-04Paper
Planar bichromatic minimum spanning trees
Journal of Discrete Algorithms
2009-12-10Paper
Connect the Dot: Computing Feed-Links with Minimum Dilation
Lecture Notes in Computer Science
2009-10-20Paper
Wooden geometric puzzles: Design and hardness proofs
Theory of Computing Systems
2009-08-06Paper
Edges and switches, tunnels and bridges
Computational Geometry
2009-06-30Paper
Optimal higher order Delaunay triangulations of polygons
Computational Geometry
2009-06-30Paper
Towards a definition of higher order constrained Delaunay triangulations
Computational Geometry
2009-03-09Paper
Placing Text Boxes on Graphs
Graph Drawing
2009-03-03Paper
Subdivision Drawings of Hypergraphs
Graph Drawing
2009-03-03Paper
Approximating largest convex hulls for imprecise points
Journal of Discrete Algorithms
2009-02-23Paper
Edges and Switches, Tunnels and Bridges
Lecture Notes in Computer Science
2009-02-17Paper
Optimization for First Order Delaunay Triangulations
Lecture Notes in Computer Science
2009-02-17Paper
Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points
Lecture Notes in Computer Science
2009-02-17Paper
Region-restricted clustering for geographic data mining
Computational Geometry
2009-02-12Paper
scientific article; zbMATH DE number 5506207 (Why is no real title available?)2009-02-10Paper
← Previous 100   1   2   Next 100 →


Research outcomes over time


This page was built for person: Marc Van Kreveld