72 citations · 98 across the 9 of their papers we have counts for
9 papers
A Fast 2-Approximation Algorithm for Guarding Orthogonal Terrains
Yangdi Lyu, Alper Üngör
Terrain Guarding Problem(TGP), which is known to be NP-complete, asks to find a smallest set of guard locations on a terrain such that every point on is visible by a guard.…
Finding a Curve in a Point Set
Paul Accisano, Alper Üngör
Let be a polygonal curve in of length , and be a point set of size . The Curve/Point Set Matching problem consists of finding a polygonal curve on…
Matching Curves to Imprecise Point Sets using Fréchet Distance
Paul Accisano, Alper Üngör
Let be a polygonal curve in of length , and be a point-set of size . The Curve/Point Set Matching problem consists of finding a polygonal curve on…
Hardness Results on Curve/Point Set Matching with Fréchet Distance
Paul Accisano, Alper Üngör
Let P be a polygonal curve in R^d of length n, and S be a point-set of size k. We consider the problem of finding a polygonal curve Q on S such that all points in S are visited and…
A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions
Sariel Har-Peled, Alper Ungor
We propose a new refinement algorithm to generate size-optimal quality-guaranteed Delaunay triangulations in the plane. The algorithm takes time, where is the…
Relaxed Scheduling in Dynamic Skin Triangulation
Herbert Edelsbrunner, Alper Ungor
We introduce relaxed scheduling as a paradigm for mesh maintenance and demonstrate its applicability to triangulating a skin surface in $\Rspace^3$.