#### Filter Results:

- Full text PDF available (84)

#### Publication Year

2005

2018

- This year (10)
- Last 5 years (73)
- Last 10 years (129)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- David Eppstein, Maarten Löffler, Darren Strash
- Exact Complexity of NP-hard Problems
- 2010

The degeneracy of an n-vertex graph G is the smallest number d such that every subgraph of G contains a vertex of degree at most d. We show that there exists a nearly-optimal fixed-parameter… (More)

- Maarten Löffler, Marc J. van Kreveld
- Algorithmica
- 2008

Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest possible convex hulls,… (More)

- Maarten Löffler, Marc J. van Kreveld
- Comput. Geom.
- 2010

We model imprecise points as regions in which one point must be located. We study computing the largest and smallest possible values of various basic geometric measures on sets of imprecise points,… (More)

- Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler, Jun Luo
- Int. J. Comput. Geometry Appl.
- 2011

In this paper we consider the problem of detecting commuting patterns in a trajectory. For this we search for similar subtrajectories. To measure spatial similarity we choose the Fréchet distance and… (More)

- Boris Aronov, Kevin Buchin, +7 authors Bettina Speckmann
- J. Spatial Information Science
- 2011

Road network analysis can require distance from points that are not on the network themselves. We study the algorithmic problem of connecting a point inside a face (region) of the road network to its… (More)

- Maarten Löffler, Jack Snoeyink
- Symposium on Computational Geometry
- 2008

An assumption of nearly all algorithms in computational geometry is that the input points are given precisely, so it is interesting to ask what is the value of imprecise information about points. We… (More)

- Maarten Löffler, Jeff M. Phillips
- ESA
- 2009

We consider problems on data sets where each data point has uncertainty described by an individual probability distribution. We develop several frameworks and algorithms for calculating statistics on… (More)

- Maarten Löffler, Wolfgang Mulzer
- SODA
- 2011

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 planar point set, given… (More)

- Ferran Hurtado, Matias Korman, +6 authors Takeshi Tokuyama
- Comput. Geom.
- 2018

We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations. Our input is a set of points in the plane which are either blue, red, or purple. Blue points… (More)