| Quality meshing with weighted Delaunay refinement |
| Full text |
Pdf
(1.04 MB)
|
| Source
|
Symposium on Discrete Algorithms
archive
Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
table of contents
San Francisco, California
Pages: 137 - 146
Year of Publication: 2002
ISBN:0-89871-513-X
|
|
Authors
|
|
| Sponsor |
|
| Publisher |
Society for Industrial and Applied Mathematics
Philadelphia, PA, USA
|
| Bibliometrics |
Downloads (6 Weeks): 8, Downloads (12 Months): 39, Citation Count: 8
|
|
|
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 silvers 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 silvers. 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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Nina Amenta , Marshall Bern , David Eppstein, Optimal point placement for mesh smoothing, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.528-537, January 05-07, 1997, New Orleans, Louisiana, United States
|
| |
2
|
M. Bern and D. Eppstein. Mesh generation and optimal triangulation. Computing in Euclidean Geometry, 2nd Ed., World Scientific, 1995, 47-123.
|
| |
3
|
|
| |
4
|
L. P. Chew. Guaranteed-quality triangular meshes. Report TR-98-983, Comput. Sci. Dept., Cornell Univ., Ithaca, New York, (1989).
|
 |
5
|
|
 |
6
|
|
 |
7
|
|
| |
8
|
T. K. Dey, C. Bajaj and K. Sugihara. On good triangulations in three dimensions. Internat. J. Comput. Geom.,2, (1992), 75-95.
|
| |
9
|
|
 |
10
|
Herbert Edelsbrunner , Xiang-Yang Li , Gary Miller , Andreas Stathopoulos , Dafna Talmor , Shang-Hua Teng , Alper Üngör , Noel Walkington, Smoothing and cleaning up slivers, Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.273-277, May 21-23, 2000, Portland, Oregon, United States
[doi> 10.1145/335305.335338]
|
| |
11
|
H. Edelsbrunner and D. Guoy. An experimental study of sliver exudation. Proc. 10th Intl. Meshing Roundtable, (2001), 307-316.
|
| |
12
|
|
 |
13
|
Gary L. Miller , Dafna Talmor , Shang-Hua Teng , Noel Walkington, A Delaunay based numerical method for three dimensions: generation, formulation, and partition, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.683-692, May 29-June 01, 1995, Las Vegas, Nevada, United States
[doi> 10.1145/225058.225286]
|
| |
14
|
|
| |
15
|
|
| |
16
|
|
 |
17
|
|
| |
18
|
G. Strang and G. J. Fix. An Analysis of the Finite Element Method. Prentice Hall, 1973.
|
|