Complexity of Delaunay Triangulation for Points on Lower-dimensional~Polyhedra
Abstract
We show that the Delaunay triangulation of a set of points distributed nearly uniformly on a polyhedron (not necessarily convex) of dimension p in d-dimensional space is O(n^(d-1)/p))$. For all p between 2 and d-1, this improves on the well-known worst-case bound of $O(n^ceil(d/2))$.
Domains
Computational Geometry [cs.CG]| Origin | Files produced by the author(s) |
|---|
Loading...