CGAL 4.7 - Kinetic Data Structures
|
#include <CGAL/Kinetic/Delaunay_triangulation_recent_edges_visitor_2.h>
The class Kinetic::Delaunay_triangulation_recent_edges_visitor_2
provides a model of Kinetic::DelaunayTriangulationVisitor_2
which tracks which edges were created in the most recent change.
Kinetic::Delaunay_triangulation_2<Traits, Triangulation, Visitor>
Creation | |
typedef unspecified_type | iterator |
The iterator through the recently created edges. | |
Delaunay_triangulation_recent_edges_visitor_2 () | |
default constructor. | |
Operations | |
iterator | begin () const |
Begin iteration through the recent edges. | |
iterator | end () const |
End iteration through the recent edges. | |
bool | contains (Triangulation::Edge) const |
Returns true if this edge exists in the set. | |