Three-Dimensional Delaunay Mesh Generation
暂无分享,去创建一个
[1] Herbert Edelsbrunner,et al. Geometry and Topology for Mesh Generation , 2001, Cambridge monographs on applied and computational mathematics.
[2] Paul-Louis George,et al. Delaunay triangulation and meshing : application to finite elements , 1998 .
[3] L. Paul Chew,et al. Guaranteed-quality Delaunay meshing in 3D (short version) , 1997, SCG '97.
[4] Jonathan Richard Shewchuk,et al. Tetrahedral mesh generation by Delaunay refinement , 1998, SCG '98.
[5] Tamal K. Dey,et al. Quality meshing with weighted Delaunay refinement , 2002, SODA '02.
[6] Scott A. Mitchell,et al. Quality Mesh Generation in Higher Dimensions , 2000, SIAM J. Comput..
[7] Xiang-Yang Li,et al. Generating well-shaped Delaunay meshed in 3D , 2001, SODA '01.
[8] David M. Mount,et al. A point-placement strategy for conforming Delaunay tetrahedralization , 2000, SODA '00.
[9] Tamal K. Dey,et al. Quality meshing for polyhedra with small angles , 2004, SCG '04.
[10] Jim Ruppert,et al. A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation , 1995, J. Algorithms.
[11] S. Teng,et al. On the Radius-Edge Condition in the Control Volume Method , 1999 .
[12] David Eppstein,et al. Provably good mesh generation , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[13] Herbert Edelsbrunner,et al. Sliver exudation , 1999, SCG '99.
[14] Dafna Talmor,et al. Well-Spaced Points for Numerical Methods , 1997 .
[15] Mariette Yvinec,et al. Conforming Delaunay triangulations in 3D , 2002, SCG '02.
[16] Sheung-Hung Poon,et al. Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio , 2003, SODA '03.
[17] Bernard Chazelle,et al. An optimal convex hull algorithm in any fixed dimension , 1993, Discret. Comput. Geom..
[18] János Pach,et al. Extremal Problems for Geometric Hypergraphs , 1996, ISAAC.
[19] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.