20 citations · 134 across the 54 of their papers we have counts for
4 papers · 1 filter
How Many Potatoes are in a Mesh?
Marc van Kreveld, Maarten Löffler, János Pach
We consider the combinatorial question of how many convex polygons can be made by using the edges taken from a fixed triangulation of n vertices. For general triangulations, there…
Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent
Maarten Löffler, Wolfgang Mulzer
We show that Delaunay triangulations and compressed quadtrees are equivalent structures. More precisely, we give two algorithms: the first computes a compressed quadtree for a plan…
Geometric Computations on Indecisive and Uncertain Points
Allan Jorgensen, Maarten Löffler, Jeff M. Phillips
We study computing geometric problems on uncertain points. An uncertain point is a point that does not have a fixed location, but rather is described by a probability distribution.…
Dynamic Planar Point Location with Sub-Logarithmic Local Updates
Maarten Löffler, Joe Simons, Darren Strash
We study planar point location in a collection of disjoint fat regions, and investigate the complexity of \emph {local updates}: replacing any region by a different region that is…