|
CGAL 6.3 - Classification
|
Topics | |
| Concepts | |
| Main Functions | |
| Functions that perform classification based on a set of labels and a classifier, with or without regularization. | |
| Classifiers | |
| Classifiers are functors that, given a label set and an input item, associate this input item with an energy for each label. | |
| Common Data Structures | |
| Useful data structures that are used to compute features (computation of eigenvalues, for example). | |
| Label | |
| A label represents how an item should be classified, for example: vegetation, building, road, etc. | |
| Feature | |
| Features are defined as scalar fields that associates each input item with a specific value. | |
| Predefined Features | |
| CGAL provides some predefined features that are relevant for classification of point sets. | |
| Point Set Classification | |
| Data structures specialized to classify point sets. | |
| Mesh Classification | |
| Data structures specialized to classify surface meshes. | |
| Cluster Classification | |
| Data structures specialized to classify clusters. | |