CGAL 6.2 - 3D Constrained Triangulations

Loading...
Searching...
No Matches
Bibliography

[1]

  F. Bagemihl. On indecomposable polyhedra. The American Mathematical Monthly, 55:411–413, September 1948.

[2]

  David Cohen-Steiner, Eric Colin De Verdiere, and Mariette Yvinec. Conforming Delaunay triangulations in 3d. In Proceedings of the eighteenth Annual Symposium on Computational Geometry, pages 199–208, 2002.

[3]

  Pascal Frey. MEDIT : An interactive Mesh visualization Software. Technical Report RT-0253, INRIA, December 2001.

[4]

  Si Hang. Tetgen, a Delaunay-based quality tetrahedral mesh generator. ACM Trans. Math. Softw, 41(2):11, 2015.

[5]

  E. Schönhardt. Über die Zerlegung von Dreieckspolyedern in Tetraeder. Math. Ann., 98:309–312, 1928.

[6]

  Jonathan Richard Shewchuk. A condition guaranteeing the existence of higher-dimensional constrained Delaunay triangulations. In Proceedings of the fourteenth Annual Symposium on Computational Geometry, pages 76–85, 1998.

[7]

  Hang Si and Klaus Gärtner. Meshing piecewise linear complexes by constrained Delaunay tetrahedralizations. In Proceedings of the 14th International Meshing Roundtable, pages 147–163. Springer, 2005.

[8]

  Hang Si. Three dimensional boundary conforming Delaunay mesh generation. Technische Universitaet Berlin (Germany), 2008.