|
The class Kinetic::Delaunay_triangulation_2<Traits, Visitor, Triangulation> maintains a Delaunay triangulation on top of the points contained in a Kinetic::ActiveObjectsTable. It has one main method of interest, triangulation(), which returns the triangulation it is maintaining.
Note that the Delaunay triangulation is fully dynamic as it tracks points added to and removed from the Kinetic::ActiveObjectsTable.
The class Kinetic::Qt_triangulation_2<KineticTriangulation_2, QtWidget_2, QtMovingPoints_2> displays a kinetic Delaunay triangulation using the Qt widget.
This class is a good example of a simple, but non-trivial, kinetic data structure.
The Triangulation template parameter must be a model of CGAL::Delaunay_triangulation_2<Traits, Tds> which uses Traits::Default_instantaneous_kernel as its geometric traits and a Tds whose face inherits from Kinetic::Delaunay_triangulation_face_base_2<Traits, Base>.
The optional Visitor parameter takes a model of Kinetic::DelaunayTriangulationVisitor_2. Methods on this object will be called whenever the triangulation changes.
#include <CGAL/Kinetic/Delaunay_triangulation_2.h>
| Kinetic::Delaunay_triangulation_2<Traits, Visitor, Triangulation> dt ( Traits tr); | |
|
Maintain the
Delaunay triangulation of the points in
tr.active_points_2_handle().
| |
Kinetic::DelaunayTriangulationVisitor_2, Kinetic::Delaunay_triangulation_default_visitor_2, Kinetic::Delaunay_triangulation_recent_edges_visitor_2<Triangulation>, Kinetic::Delaunay_triangulation_event_log_visitor_2, Kinetic::Qt_Delaunay_triangulation_2.