CGAL 6.2 - Halfedge Data Structures

Loading...
Searching...
No Matches
HalfedgeDS/hds_prog_halfedge_iterator.cpp
#include <CGAL/HalfedgeDS_default.h>
#include <CGAL/HalfedgeDS_decorator.h>
#include <cassert>
struct Traits { typedef int Point_2; };
typedef CGAL::HalfedgeDS_default<Traits> HDS;
typedef CGAL::HalfedgeDS_decorator<HDS> Decorator;
typedef HDS::Halfedge_iterator Iterator;
int main() {
HDS hds;
Decorator decorator(hds);
decorator.create_loop();
decorator.create_segment();
assert( decorator.is_valid());
int n = 0;
for ( Iterator i = hds.halfedges_begin(); i != hds.halfedges_end(); ++i )
++n;
assert( n == 4); // == 2 edges
return 0;
}
CGAL::HalfedgeDS_decorator
The class CGAL::HalfedgeDS_items_decorator<HDS> provides additional functions for vertices,...
Definition: HalfedgeDS_decorator.h:54
CGAL::HalfedgeDS_default
The class HalfedgeDS_default is a model for the HalfedgeDS concept.
Definition: HalfedgeDS_default.h:36
Iterator