\( \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.9 - Triangulated Surface Mesh Simplification
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Classes
Concepts
Triangulated Surface Mesh Simplification Reference

Concepts

conceptEdgeCollapsableSurfaceMesh
 The concept EdgeCollapsableSurfaceMesh describes the requirements for the type of triangulated surface mesh that can be passed to the simplification algorithm. More...
 
conceptEdgeCollapsableSurfaceMeshWithConstraints
 The concept EdgeCollapsableSurfaceMeshWithConstraints describes additional requirements for the type of triangulated surface meshes that can be passed to the simplification algorithm. More...
 
conceptEdgeCollapseSimplificationVisitor
 The concept EdgeCollapseSimplificationVisitor describes the requirements for the visitor object which is used to track the edge collapse simplification algorithm. More...
 
conceptEdgeProfile
 The concept EdgeProfile describes the requirements for a data structure that caches the local topology and geometry in the surroundings of a halfedge. More...
 
conceptGetCost
 The concept GetCost describes the requirements for the policy function object which gets the collapse cost of an edge. More...
 
conceptGetPlacement
 The concept GetPlacement describes the requirements for the policy function object which gets the collapse placement of an edge, that is, the new position of the vertex that remains after a halfedge-collapse operation. More...
 
conceptStopPredicate
 The concept StopPredicate describes the requirements for the predicate which indicates if the simplification process must finish. More...