13 citations · 26 across the 20 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.CG2018
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…
cs.CG2018
Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon
Pankaj K. Agarwal, Lars Arge, Frank Staals
We present an efficient dynamic data structure that supports geodesic nearest neighbor queries for a set of point sites in a static simple polygon . Our data structure allow…
cs.CG2018
Convexity-Increasing Morphs of Planar Graphs
Linda Kleist, Boris Klemz, Anna Lubiw +3
We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawing of an internally 3-connected graph, we show how to morph the drawing to one w…