\( \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 - Point Set Shape Detection

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Modules | Files | Classes
Point Set Shape Detection Reference

##

Sven Oesau, Yannick Verdie, Clément Jamin, Pierre Alliez
This component implements an efficient RANSAC-based primitive shape detection algorithm for point sets with unoriented normals. Five types of primitive shapes are detected: plane, sphere, cylinder, cone and torus. Other types of shapes can be detected through implementing a class deriving from the base shape class.

Introduced in: CGAL 4.7
BibTeX: cgal:ovja-pssd-16a
License: GPL
Windows Demo: Operations on Polyhedra
Common Demo Dlls: dlls

## Classified Reference Pages

## Concept

- `EfficientRANSACTraits`

## Main Classes

- `CGAL::Shape_detection_3::Efficient_RANSAC<Traits>`
- `CGAL::Shape_detection_3::Efficient_RANSAC_traits`

## Shape Interface

- `CGAL::Shape_detection_3::Shape_base<Traits>`

## Shape Classes

- `CGAL::Shape_detection_3::Plane<Traits>`
- `CGAL::Shape_detection_3::Sphere<Traits>`
- `CGAL::Shape_detection_3::Cylinder<Traits>`
- `CGAL::Shape_detection_3::Cone<Traits>`
- `CGAL::Shape_detection_3::Torus<Traits>`

## Modules
| Concepts
| Shapes

## Files
file | Shape_detection_3.h
| Convenience header file including the headers of this package.

## Classes
class | CGAL::Shape_detection_3::Efficient_RANSAC< Traits >
| A shape detection algorithm using a RANSAC method. More...
struct | CGAL::Shape_detection_3::Efficient_RANSAC_traits< Gt, InputRange, InputPointMap, InputNormalMap >
| Default traits class to use the shape detection class `Efficient_RANSAC`. More...