DMCA
Quality Meshing with Weighted Delaunay Refinement (2002)
Cached
Download Links
- [www.cs.ust.hk]
- [www.cis.ohio-state.edu]
- [www.cs.ust.hk]
- [www.cs.ust.hk]
- DBLP
Other Repositories/Bibliography
| Venue: | SIAM J. Comput |
| Citations: | 40 - 7 self |
BibTeX
@INPROCEEDINGS{Cheng02qualitymeshing,
author = {Siu-Wing Cheng and Tamal K. Dey},
title = {Quality Meshing with Weighted Delaunay Refinement},
booktitle = {SIAM J. Comput},
year = {2002},
pages = {137--146}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Delaunay meshes with bounded circumradius to shortest edge length ratio have been proposed in the past for quality meshing. The only poor quality tetrahedra called slivers that can occur in such a mesh can be eliminated by the sliver exudation method. This method has been shown to work for periodic point sets, but not with boundaries. Recently a randomized point-placement strategy has been proposed to remove slivers while conforming to a given boundary. In this paper we present a deterministic algorithm for generating a weighted Delaunay mesh which respects the input boundary and has no poor quality tetrahedron including slivers. This success is achieved by combining the weight pumping method for sliver exudation and the Delaunay refinement method for boundary conformation. We show that an incremental weight pumping can be mixed seamlessly with vertex insertions in our weighted Delaunay refinement paradigm. 1
Keyphrases
weighted delaunay refinement poor quality tetrahedron quality meshing sliver exudation boundary conformation deterministic algorithm weighted delaunay mesh edge length ratio delaunay refinement method vertex insertion periodic point set input boundary sliver exudation method bounded circumradius weighted delaunay refinement paradigm delaunay mesh incremental weight pumping randomized point-placement strategy
