15 citations · 15 across the 3 of their papers we have counts for
16 papers · 1 filter
Robust Classification of Dynamic Bichromatic point Sets in R2
Erwin Glazenburg, Frank Staals, Marc van Kreveld
Let be a set of points in , and let . Our goal is to compute a line that "best" separates the "red" points from the "blue" points w…
Capturing the Shape of a Point Set with a Line Segment
Nathan van Beusekom, Marc van Kreveld, Max van Mulken +3
Detecting location-correlated groups in point sets is an important task in a wide variety of applications areas. In addition to merely detecting such groups, the group's shape carr…
Faster Fréchet Distance Approximation through Truncated Smoothing
Thijs van der Horst, Marc van Kreveld, Tim Ophelders +1
The Fréchet distance is a commonly used distance measure for curves. Computing the Fréchet distance between two polygonal curves of vertices takes roughly quadratic time, and c…
Collision Detection for Modular Robots -- it is easy to cause collisions and hard to avoid them
Siddharth Gupta, Marc van Kreveld, Othon Michail +1
We consider geometric collision-detection problems for modular reconfigurable robots. Assuming the nodes (modules) are connected squares on a grid, we investigate the complexity of…
The Complexity of Geodesic Spanners
Sarita de Berg, Marc van Kreveld, Frank Staals
A geometric -spanner for a set of point sites is an edge-weighted graph for which the (weighted) distance between any two sites is at most times the orig…
A Subquadratic -approximation for the Continuous Fréchet Distance
Thijs van der Horst, Marc van Kreveld, Tim Ophelders +1
The Fréchet distance is a commonly used similarity measure between curves. It is known how to compute the continuous Fréchet distance between two polylines with and vertice…