File: triangulation2.cpp

package info (click to toggle)
cgal 4.9-1
  • links: PTS
  • area: main
  • in suites: stretch
  • size: 85,584 kB
  • sloc: cpp: 640,841; ansic: 140,696; sh: 708; fortran: 131; makefile: 114; python: 92
file content (18 lines) | stat: -rw-r--r-- 633 bytes parent folder | download | duplicates (2) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
 
{ 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;
}