Constructing higher-dimensional convex hulls at logarithmic cost per face
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Higher-dimensional Voronoi diagrams in linear expected time
Discrete & Computational Geometry
Small-dimensional linear programming and convex hulls made easy
Discrete & Computational Geometry
Output-sensitive results on convex hulls, extreme points, and related problems
Proceedings of the eleventh annual symposium on Computational geometry
How good are convex hull algorithms?
Computational Geometry: Theory and Applications
The probabilistic complexity of the Voronoi diagram of points on a polyhedron
Proceedings of the eighteenth annual symposium on Computational geometry
Complexity of the delaunay triangulation of points on surfaces the smooth case
Proceedings of the nineteenth annual symposium on Computational geometry
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes
Computational Geometry: Theory and Applications
A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces
Discrete & Computational Geometry
Topology guaranteeing manifold reconstruction using distance function to noisy data
Proceedings of the twenty-second annual symposium on Computational geometry
A sampling theory for compact sets in Euclidean space
Proceedings of the twenty-second annual symposium on Computational geometry
Weak witnesses for Delaunay triangulations of submanifolds
Proceedings of the 2007 ACM symposium on Solid and physical modeling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Delaunay triangulations in O(sort(n)) time and more
Journal of the ACM (JACM)
Vietoris-rips complexes also provide topologically correct reconstructions of sampled shapes
Proceedings of the twenty-seventh annual symposium on Computational geometry
Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes
Computational Geometry: Theory and Applications
Practical distribution-sensitive point location in triangulations
Computer Aided Geometric Design
RDELA--a Delaunay-triangulation-based, location and covariance estimator with high breakdown point
Statistics and Computing
| Hi-index | 0.00 |
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 2 ≤ p ≤ d - 1, this improves on the well-known worst-case bound of O(n⌈d/2⌉).