CGAL 6.1 - Halfedge Data Structures

Loading...
Searching...
No Matches
HalfedgeDS/hds_prog_graph2.cpp
#include <CGAL/HalfedgeDS_min_items.h>
#include <CGAL/HalfedgeDS_default.h>
#include <CGAL/HalfedgeDS_decorator.h>
#include <cassert>
// An items type using a halfedge with previous-pointer.
struct My_items : public CGAL::HalfedgeDS_min_items {
template <class Refs, class Traits>
struct Halfedge_wrapper {
typedef CGAL::HalfedgeDS_halfedge_base< Refs,
CGAL::Tag_true, // previous pointer selected.
CGAL::Tag_false, // pointer to vertex not selected.
CGAL::Tag_false // pointer to face not selected.
> Halfedge;
};
};
// no traits needed, argument can be arbitrary dummy.
typedef CGAL::HalfedgeDS_default<int, My_items> HDS;
typedef CGAL::HalfedgeDS_decorator<HDS> Decorator;
int main() {
HDS hds;
Decorator decorator(hds);
decorator.create_loop();
assert( decorator.is_valid());
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
CGAL::HalfedgeDS_halfedge_base
The class HalfedgeDS_halfedge_base is a model of the HalfedgeDSHalfedge concept.
Definition: HalfedgeDS_halfedge_base.h:72
CGAL::HalfedgeDS_min_items
The class HalfedgeDS_min_items is a model of the HalfedgeDSItems concept.
Definition: HalfedgeDS_min_items.h:49
CGAL::Tag_false
CGAL::Boolean_tag< false > Tag_false
CGAL::Tag_true
CGAL::Boolean_tag< true > Tag_true
CGAL::Boolean_tag