\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)

CGAL 4.8 - Surface Mesh

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Class and Concept List
Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.
[detail level 1 2 3]

boost |
hash< CGAL::SM_Vertex_index > |
CGAL |
Surface_mesh | This class is a data structure that can be used as halfedge data structure or polyhedral surface. It is an alternative to the classes `HalfedgeDS` and `Polyhedron_3` defined in the packages Halfedge Data Structures and 3D Polyhedral Surface. The main difference is that it is indexed based and not pointer based, and that the mechanism for adding information to vertices, halfedges, edges, and faces is much simpler and done at runtime and not at compile time. When elements are removed, they are only marked as removed, and a garbage collection function must be called to really remove them
Edge_index | This class represents an edge
Face_index | This class represents a face
Halfedge_index | This class represents a halfedge
Vertex_index | This class represents a vertex
std | STL namespace
hash< CGAL::SM_Halfedge_index > |
hash< CGAL::SM_Vertex_index > |
hash< CGAL::SM_Face_index > |
hash< CGAL::SM_Edge_index > |