\( \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.2 - Triangulated Surface Mesh Simplification
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members
CGAL::Surface_mesh_simplification::Constrained_placement< BasePlacement, EdgeIsConstrainedMap > Class Template Reference
Triangulated Surface Mesh Simplification Reference

#include <CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Constrained_placement.h>

Inherits from

BasePlacement.

Definition

The class Constrained_placement is a model for the GetPlacement concept provided the template parameter BasePlacement is such a model.

The placement of the vertex resulting from a contraction of an edge adjacent to a constrained edge is the point of the common vertex. Otherwise the placement is the one computed by BasePlacement.

Template Parameters
BasePlacementa model of GetPlacement.
EdgeIsConstrainedMapa model of boost::ReadablePropertyMap with GetPlacement::Profile::edge_descriptor as key type and bool as value type indicating if an edge is constrained.
Is Model Of:
GetPlacement

Creation

 Constrained_placement (EdgeIsConstrainedMap map=EdgeIsConstrainedMap(), BasePlacement base=BasePlacement())
 Constructor.