CGAL Version:
master
6.0.1
latest
5.6.2
5.5.5
5.4.5
5.3.2
5.2.4
5.1.5
5.0.4
4.14.3
4.13.2
4.12.2
4.11.3
4.10.2
4.9.1
4.8.2
4.7
4.6.3
4.5.2
4.4
4.3
cgal.org
Top
Getting Started
Organization of the Manual
Package Overview
Acknowledging CGAL
CGAL 4.8.2 - dD Triangulations
•
All
Classes
Namespaces
Files
Functions
Variables
Typedefs
Enumerations
Enumerator
Groups
Pages
CGAL 4.8.2 - dD Triangulations
User Manual
Reference Manual
Refinement Relationships
Is Model Relationships
Has Model Relationships
Class and Concept List
Examples
barycentric_subdivision.cpp
delaunay_triangulation.cpp
triangulation.cpp
triangulation1.cpp
triangulation2.cpp
triangulation_data_structure_dynamic.cpp
triangulation_data_structure_static.cpp
triangulation2.cpp
{
int
i=0;
typedef
Triangulation::Full_cell_handle Full_cell_handle;
typedef
Triangulation::Facet Facet;
typedef
std::vector<Full_cell_handle> Full_cells;
Full_cells infinite_full_cells;
std::back_insert_iterator<Full_cells> out(infinite_full_cells);
t.incident_full_cells(t.infinite_vertex(), out);
for
( Full_cells::iterator sit = infinite_full_cells.begin();
sit != infinite_full_cells.end(); ++sit )
{
Facet ft(*sit, (*sit)->index(t.infinite_vertex()));
++i;
// |ft| is a facet of the convex hull
}
std::cout <<
"There are "
<< i <<
" facets on the convex hull."
<< std::endl;
}