272 citations · 273 across the 3 of their papers we have counts for
3 papers
cs.CG2005★ 1 cited
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…
cs.DS2004★ 272 cited
Fast Construction of Nets in Low Dimensional Metrics, and Their Applications
Sariel Har-Peled, Manor Mendel
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain i…
cs.CG2002
Optimally cutting a surface into a disk
Jeff Erickson, Sariel Har-Peled
We consider the problem of cutting a set of edges on a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total number…