CGAL::Kinetic::Delaunay_triangulation_recent_edges_visitor_2<Triangulation>
Definition
The concept Kinetic::Delaunay_triangulation_recent_edges_visitor_2<Triangulation> provides a model of
Kinetic::DelaunayTriangulationVisitor_2 which tracks which edges were created in
the most recent change.
Is Model for the Concepts
Kinetic::DelaunayTriangulationVisitor_2
Creation
Kinetic::Delaunay_triangulation_recent_edges_visitor_2<Triangulation> a;
|
|
default constructor.
|
|
Kinetic::Delaunay_triangulation_recent_edges_visitor_2<Triangulation>::iterator
|
|
The iterator through the recently created edges.
|
Operations
iterator
|
a.begin ()
|
Begin iteration through the recent edges.
|
|
iterator
|
a.end ()
|
End iteration through the recent edges.
|
|
bool
|
a.contains ( Triangulation::Edge)
|
Returns true if this edge exists in the set.
|
See Also
Kinetic::Delaunay_triangulation_2<Traits, Triangulation, Visitor>