CGAL 5.2.1 - 3D Triangulation Data Structure
3D Triangulation Data Structure Reference
Clément Jamin, Sylvain Pion and Monique Teillaud
This package provides a data structure to store a three-dimensional triangulation that has the topology of a three-dimensional sphere. The package acts as a container for the vertices and cells of the triangulation and provides basic combinatorial operations on the triangulation.
Introduced in: CGAL 2.1
BibTeX: cgal:pt-tds3-21a

The triangulation data structure is able to represent a triangulation of a topological sphere $$S^d$$ of $$\mathbb{R}^{d+1}$$, for $$d \in \{-1,0,1,2,3\}$$. (See Representation.)

The vertex class of a 3D-triangulation data structure must define a number of types and operations. The requirements that are of geometric nature are required only when the triangulation data structure is used as a layer for the geometric triangulation classes. (See Section Software Design.)

The cell class of a triangulation data structure stores four handles to its four vertices and four handles to its four neighbors. The vertices are indexed 0, 1, 2, and 3 in a consistent order. The neighbor indexed $$i$$ lies opposite to vertex i.

In degenerate dimensions, cells are used to store faces of maximal dimension: in dimension 2, each cell represents only one facet of index 3, and 3 edges $$(0,1)$$, $$(1,2)$$ and $$(2,0)$$; in dimension 1, each cell represents one edge $$(0,1)$$. (See Section Representation.)

## Classes

CGAL provides base vertex classes and base cell classes:

## Modules

Concepts

Classes

I/O for a Triangulation_data_structure_3