|
The Triangulation data structure can be seen has a container
for the faces and vertices of the triangulation. This class is also
responsible for the combinatorial integrity of the triangulation. This
means that the triangulation data strucure maintains proper incidence
and adjacency relations among the vertices and faces of a
triangulation while combinatorial modifications of the triangulation
are performed.
| Functionality: | dynamic |
| Robustness: | industry strong |
| License: | QPL, commercial |
| Developed by: | INRIA |
|