Quality meshing with weighted delaunay refinement

被引:21
作者
Cheng, SW
Dey, TK
机构
[1] Hong Kong Univ Sci & Technol, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
[2] Ohio State Univ, Dept Comp & Informat Sci, Columbus, OH 43210 USA
关键词
tetrahedral mesh generation; mesh quality; algorithms; computational geometry; Delaunay triangulation; weighted Delaunay refinement; sliver;
D O I
10.1137/S0097539703418808
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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. As in previous work, we assume that no input angle is acute. Our result is achieved by combining the weight pumping method for sliver exudation and the Delaunay refinement method for boundary conformation.
引用
收藏
页码:69 / 93
页数:25
相关论文
共 22 条
[1]  
Amenta N, 1997, PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P528
[2]   PROVABLY GOOD MESH GENERATION [J].
BERN, M ;
EPPSTEIN, D ;
GILBERT, J .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1994, 48 (03) :384-409
[3]  
Bern M, 2000, HANDBOOK OF COMPUTATIONAL GEOMETRY, P291, DOI 10.1016/B978-044482537-7/50007-3
[4]   CUTTING HYPERPLANES FOR DIVIDE-AND-CONQUER [J].
CHAZELLE, B .
DISCRETE & COMPUTATIONAL GEOMETRY, 1993, 9 (02) :145-158
[5]   Sliver exudation [J].
Cheng, SW ;
Dey, TK ;
Edelsbrunner, H ;
Facello, MA ;
Teng, SH .
JOURNAL OF THE ACM, 2000, 47 (05) :883-904
[6]  
Chew L. P., 1997, Proceedings of the Thirteenth Annual Symposium on Computational Geometry, P391, DOI 10.1145/262839.263018
[7]  
CHEW LP, 1989, TR98983 CORN U COMP
[8]   ON GOOD TRIANGULATIONS IN THREE DIMENSIONS [J].
Dey, Tamal Krishna ;
Bajaj, Chanderjit L. ;
Sugihara, Kokichi .
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1992, 2 (01) :75-95
[9]   Extremal problems for geometric hypergraphs [J].
Dey, TK ;
Pach, J .
DISCRETE & COMPUTATIONAL GEOMETRY, 1998, 19 (04) :473-484
[10]  
Edelsbrunner H., 2000, Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing, P273, DOI 10.1145/335305.335338