A Delaunay refinement algorithm for quality 2-dimensional mesh generation
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Selected papers from the 12th annual symposium on Computational Geometry
On the Radius-Edge Condition in the Control Volume Method
SIAM Journal on Numerical Analysis
Lectures on Discrete Geometry
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
SIAM Journal on Computing
Building triangulations using ε-nets
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
Proceedings of the twenty-fifth annual symposium on Computational geometry
Topological inference via meshing
Proceedings of the twenty-sixth annual symposium on Computational geometry
Beating the spread: time-optimal point meshing
Proceedings of the twenty-seventh annual symposium on Computational geometry
Mesh generation and geometric persistent homology
Mesh generation and geometric persistent homology
New Bounds on the Size of Optimal Meshes
Computer Graphics Forum
Delaunay Mesh Generation
A new approach to output-sensitive voronoi diagrams and delaunay triangulations
Proceedings of the twenty-ninth annual symposium on Computational geometry
Improving spatial coverage while preserving the blue noise of point sets
Computer-Aided Design
| Hi-index | 0.00 |
We present a new algorithm that produces a well-spaced superset of points conforming to a given input set in any dimension with guaranteed optimal output size. We also provide an approximate Delaunay graph on the output points. Our algorithm runs in expected time O(2O(d)(n log n + m)), where n is the input size, m is the output point set size, and d is the ambient dimension. The constants only depend on the desired element quality bounds. To gain this new efficiency, the algorithm approximately maintains the Voronoi diagram of the current set of points by storing a superset of the Delaunay neighbors of each point. By retaining quality of the Voronoi diagram and avoiding the storage of the full Voronoi diagram, a simple exponential dependence on d is obtained in the running time. Thus, if one only wants the approximate neighbors structure of a refined Delaunay mesh conforming to a set of input points, the algorithm will return a size 2O(d)m graph in 2O(d)(n log n + m) expected time. If m is superlinear in n, then we can produce a hierarchically well-spaced superset of size 2O(d)n in 2O(d)n log n expected time.