22 citations · 38 across the 4 of their papers we have counts for
6 papers · 1 filter
Map-Matching Queries under Fréchet Distance on Low-Density Spanners
Kevin Buchin, Maike Buchin, Joachim Gudmundsson +2
Map matching is a common task when analysing GPS tracks, such as vehicle trajectories. The goal is to match a recorded noisy polygonal curve to a path on the map, usually represent…
Oriented Spanners
Kevin Buchin, Joachim Gudmundsson, Antonia Kalb +4
Given a point set in the Euclidean plane and a parameter , we define an \emph{oriented -spanner} as an oriented subgraph of the complete bi-directed graph such that f…
Segment Visibility Counting Queries in Polygons
Kevin Buchin, Bram Custers, Ivor van der Hoog +4
Let be a simple polygon with vertices, and let be a set of points or line segments inside . We develop data structures that can efficiently count the number of o…
Computing the Fréchet Distance Between Uncertain Curves in One Dimension
Kevin Buchin, Maarten Löffler, Tim Ophelders +3
We consider the problem of computing the Fréchet distance between two curves for which the exact locations of the vertices are unknown. Each vertex may be placed in a given uncerta…
Uncertain Curve Simplification
Kevin Buchin, Maarten Löffler, Aleksandr Popov +1
We study the problem of polygonal curve simplification under uncertainty, where instead of a sequence of exact points, each uncertain point is represented by a region, which contai…
Fréchet Distance for Uncertain Curves
Kevin Buchin, Chenglin Fan, Maarten Löffler +3
In this paper we study a wide range of variants for computing the (discrete and continuous) Fréchet distance between uncertain curves. We define an uncertain curve as a sequence of…