CGAL 6.3 - Feature Graph
Loading...
Searching...
No Matches
Reference Manual

Ange Clément
This package provides methods to extract a feature graph from three-dimensional surface data. A feature graph is a data structure that represent the sharp lines on the surface. The goal of the feature detection methods is to construct lines that can be used for future mesh generation.
Introduced in: CGAL 6.2
BibTeX: cgal:c-fg-26b
License: GPL

The feature graph is extracted in multiple steps. First, a sharpness evaluation is conducted on the surface elements. Then, from this measure, smooth elements are discarded, and a graph thinning process generates lines that are guaranteed to be positioned along the highest values of the measure. Finally, the result is refined with a correction step and an optimization phase to ensure the correct placement of lines and corners along estimated normals.

Classified Reference Pages

Concepts

Concept representing the input surface:

Secondary concepts:

Feature Graph Detectors

Sharpness Estimators

Normal Estimators

Topics

 Concepts
 Feature Graph Detector
 The detectors in this group allow the user to extract the feature graph from different types of surfaces.
 Sharpness Estimator
 The detectors in this group allow the user to estimate the sharpness on surfaces.
 Normal Estimator
 The detectors in this group allow the user to estimate the normal on surfaces.