\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.3 - Kinetic Data Structures
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members
CGAL::Kinetic::Delaunay_triangulation_recent_edges_visitor_2< Triangulation > Class Template Reference
Delaunay Triangulation in 2D

#include <CGAL/Kinetic/Delaunay_triangulation_recent_edges_visitor_2.h>

Definition

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.

Is Model Of:
Kinetic::DelaunayTriangulationVisitor_2
See Also
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.