Carnegie Mellon University
file.pdf (202.26 kB)
Download file

Sparse Voronoi Refinement

Download (202.26 kB)
journal contribution
posted on 1989-08-01, 00:00 authored by Benoit Hudson, Gary L. Miller, Todd Phillips
We present a new algorithm, Sparse Voronoi Refinement, that produces a conformal Delaunay mesh in arbitrary dimension with guaranteed mesh size and quality. Our algorithm runs in output-sensitive time O(n log(L/s) + m), with constants depending only on dimension and on prescribed element shape quality bounds. For a large class of inputs, including integer coordinates, this matches the optimal time bound of Θ(n log n + m). Our new technique uses interleaving: we maintain a sparse mesh as we mix the recovery of input features with the addition of Steiner vertices for quality improvement.


Publisher Statement

All Rights Reserved



Usage metrics