An experimental study of sliver exudation

被引：30
作者：
Edelsbrunner, H
Guoy, D
机构：
[1] Duke Univ, Dept Comp Sci, Durham, NC 27706 USA
[2] Raindrop Geomagic, Res Triangle Pk, NC USA
[3] Univ Illinois, Ctr Simulat Adv Rockets, Computat Sci & Engn Program, Urbana, IL 61801 USA
来源：
ENGINEERING WITH COMPUTERS | 2002年 / 18卷 / 03期
关键词：
dynamic triangulation; mesh generation; mesh quality; slivers; tetrahedra; weighted Delaunay triangulations;
D O I：
10.1007/s003660200020
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
We present results on a two-step improvement of mesh quality in three-dimensional Delaunay triangulations. The first step refines the triangulation by inserting sinks and eliminates tetrahedra with large circumradius over shortest edge length ratio. The second step assigns weights to the vertices to eliminate slivers. Our experimental findings provide evidence for the practical effectiveness of sliver exudation.
引用
收藏
页码：229 / 240
页数：12
相关论文
共 11 条
[1]  
[Anonymous], GEOMETRY TOPOLOGY ME
[2]  
CAVENDISH JC, 1985, INT J NUMER METH ENG, V21, P329
[3]   Sliver exudation [J].
Cheng, SW ;
Dey, TK ;
Edelsbrunner, H ;
Facello, MA ;
Teng, SH .
JOURNAL OF THE ACM, 2000, 47 (05) :883-904
[4]  
Chew L. P., 1997, Proceedings of the Thirteenth Annual Symposium on Computational Geometry, P391, DOI 10.1145/262839.263018
[5]  
Edelsbrunner H., 2002, International Journal of Foundations of Computer Science, V13, P223, DOI 10.1142/S0129054102001060
[6]  
Edelsbrunner H., 2000, Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing, P273, DOI 10.1145/335305.335338
[7]   SIMULATION OF SIMPLICITY - A TECHNIQUE TO COPE WITH DEGENERATE CASES IN GEOMETRIC ALGORITHMS [J].
EDELSBRUNNER, H ;
MUCKE, EP .
ACM TRANSACTIONS ON GRAPHICS, 1990, 9 (01) :66-104
[8]  
Edelsbrunner H, 1996, ALGORITHMICA, V15, P223, DOI 10.1007/BF01975867
[9]  
Li XY, 2001, SIAM PROC S, P28
[10]   A DELAUNAY REFINEMENT ALGORITHM FOR QUALITY 2-DIMENSIONAL MESH GENERATION [J].
RUPPERT, J .
JOURNAL OF ALGORITHMS, 1995, 18 (03) :548-585
12