File: triangulation2.h

package info (click to toggle)
cgal 6.0.1-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 141,840 kB
  • sloc: cpp: 797,081; ansic: 203,398; sh: 490; python: 411; makefile: 286; javascript: 174
file content (18 lines) | stat: -rw-r--r-- 627 bytes parent folder | download | duplicates (3)
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;
}