20 citations · 30 across the 4 of their papers we have counts for
7 papers · 1 filter
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…
Obstructing Classification via Projection
Pantea Haghighatkhah, Wouter Meulemans, Bettina Speckman +2
Machine learning and data mining techniques are effective tools to classify large amounts of data. But they tend to preserve any inherent bias in the data, for example, with regard…
Chasing Puppies: Mobile Beacon Routing on Closed Curves
Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna +5
We solve an open problem posed by Michael Biro at CCCG 2013 that was inspired by his and others' work on beacon-based routing. Consider a human and a puppy on a simple closed curve…
The -Fréchet distance
Hugo A Akitaya, Maike Buchin, Leonie Ryvkin +1
We introduce a new distance measure for comparing polygonal chains: the -Fréchet distance. As the name implies, it is closely related to the well-studied Fréchet distance but de…
Convex partial transversals of planar regions
Vahideh Keikha, Mees van de Kerkhof, Marc van Kreveld +6
We consider the problem of testing, for a given set of planar regions and an integer , whether there exists a convex shape whose boundary intersects at least region…
-Stars or On Extending a Drawing of a Connected Subgraph
Tamara Mchedlidze, Jérôme Urhausen
We consider the problem of extending the drawing of a subgraph of a given plane graph to a drawing of the entire graph using straight-line and polyline edges. We define the notion…
Maximum-Area Triangle in a Convex Polygon, Revisited
Vahideh Keikha, Maarten Löffler, Ali Mohades +2
We revisit the following problem: Given a convex polygon , find the largest-area inscribed triangle. We show by example that the linear-time algorithm presented in 1979 by Dobki…