Sparse Voronoi Refinement

DMCA

Sparse Voronoi Refinement (2006)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Benoît Hudson , Gary Miller , Todd Phillips

Venue:	IN PROCEEDINGS OF THE 15TH INTERNATIONAL MESHING ROUNDTABLE
Citations:	42 - 26 self

BibTeX

@TECHREPORT{Hudson06sparsevoronoi,
    author = {Benoît Hudson and Gary Miller and Todd Phillips},
    title = {Sparse Voronoi Refinement},
    institution = {IN PROCEEDINGS OF THE 15TH INTERNATIONAL MESHING ROUNDTABLE},
    year = {2006}
}

OpenURL

Abstract

... a conformal Delaunay mesh in arbitrary dimension with guaranteed mesh size and quality. Our algorithm runs in output-sensitive time O(nlog(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.

Keyphrases

sparse voronoi refinement quality improvement new technique integer coordinate conformal delaunay mesh sparse mesh prescribed element shape quality bound input feature steiner vertex large class guaranteed mesh size arbitrary dimension optimal time bound output-sensitive time

DMCA