Boundary recovery for conforming Delaunay triangulation of curved complexes
暂无分享,去创建一个
[1] J. Remacle,et al. Gmsh: A 3‐D finite element mesh generator with built‐in pre‐ and post‐processing facilities , 2009 .
[2] Adriano Chaves Lisboa,et al. Delaunay refinement for curved complexes , 2008 .
[3] Jonathan Richard Shewchuk,et al. Constrained Delaunay Tetrahedralizations and Provably Good Boundary Recovery , 2002, IMR.
[4] Jim Ruppert,et al. A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation , 1995, J. Algorithms.
[5] Joshua A. Levine,et al. Delaunay Meshing of Piecewise Smooth Complexes without Expensive Predicates , 2009, Algorithms.
[6] Joshua A. Levine,et al. Delaunay Meshing of Isosurfaces , 2007, IEEE International Conference on Shape Modeling and Applications 2007 (SMI '07).
[7] Adrian Bowyer,et al. Computing Dirichlet Tessellations , 1981, Comput. J..
[8] D. F. Watson. Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..
[9] J. Shewchuk,et al. Delaunay refinement mesh generation , 1997 .
[10] Herbert Edelsbrunner,et al. Triangulating Topological Spaces , 1997, Int. J. Comput. Geom. Appl..
[12] Christophe Geuzaine,et al. Gmsh: A 3‐D finite element mesh generator with built‐in pre‐ and post‐processing facilities , 2009 .
[13] L. Paul Chew,et al. Guaranteed-quality mesh generation for curved surfaces , 1993, SCG '93.
[14] T. Dey,et al. Theory of a Practical Delaunay Meshing Algorithm for a Large Class of Domains , 2009 .
[15] Tamal K. Dey,et al. Delaunay Refinement for Piecewise Smooth Complexes , 2007, SODA '07.
[16] Les A. Piegl,et al. The NURBS Book , 1995, Monographs in Visual Communication.