Triangulations in CGAL
- 1 May 2002
- journal article
- conference paper
- Published by Elsevier in Computational Geometry
- Vol. 22 (1-3) , 5-19
- https://doi.org/10.1016/s0925-7721(01)00054-2
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Foundations of dissipative particle dynamicsPhysical Review E, 2000
- Using generic programming for designing a data structure for polyhedral surfacesComputational Geometry, 1999
- Checking the convexity of polytopes and the planarity of subdivisionsComputational Geometry, 1998
- The quickhull algorithm for convex hullsACM Transactions on Mathematical Software, 1996
- Triangle: Engineering a 2D quality mesh generator and Delaunay triangulatorPublished by Springer Nature ,1996
- N-DIMENSIONAL GENERALIZED COMBINATORIAL MAPS AND CELLULAR QUASI-MANIFOLDSInternational Journal of Computational Geometry & Applications, 1994
- Voronoi diagrams—a survey of a fundamental geometric data structureACM Computing Surveys, 1991
- A faster divide-and-conquer algorithm for constructing delaunay triangulationsAlgorithmica, 1987
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- Über die Zerlegung von Dreieckspolyedern in TetraederMathematische Annalen, 1928