Kinetic Data Structures
Reference Manual

Daniel Russel

53.5   Classified Reference Pages

Kinetic data structures are a way of adding motion to classical geometric data structures. CGAL provides several prepackaged kinetic data structures. Here we present those kinetic data structures and the helper classes that allow their activity to be monitored.

Sorting

Kinetic::Sort<Traits, Visitor>

Kinetic::SortVisitor

CGAL::Kinetic::Sort_visitor_base

CGAL::Kinetic::Sort_event_log_visitor

Delaunay Triangulation in 2D

CGAL::Kinetic::Delaunay_triangulation_2<Traits, Visitor, Triangulation>

Kinetic::DelaunayTriangulationVisitor_2

CGAL::Kinetic::Delaunay_triangulation_event_log_visitor_2

CGAL::Kinetic::Delaunay_triangulation_recent_edges_visitor_2<Triangulation>

CGAL::Kinetic::Delaunay_triangulation_visitor_base_2

CGAL::Kinetic::Delaunay_triangulation_face_base_2<Traits, Base>

Delaunay and Regular Triangulations in 3D

CGAL::Kinetic::Delaunay_triangulation_3<Traits, Visitor, Triangulation>

Kinetic::DelaunayTriangulationVisitor_3

CGAL::Kinetic::Delaunay_triangulation_event_log_visitor_3

CGAL::Kinetic::Delaunay_triangulation_visitor_base_3

CGAL::Kinetic::Delaunay_triangulation_cell_base_3<Traits, Base>

CGAL::Kinetic::Regular_triangulation_3<Traits, Visitor, Triangulation>

Kinetic::RegularTriangulationVisitor_3

CGAL::Kinetic::Regular_triangulation_visitor_base_3

CGAL::Kinetic::Regular_triangulation_event_log_visitor_3

CGAL::Kinetic::Regular_triangulation_cell_base_3<Traits, Base>

CGAL::Kinetic::Regular_triangulation_vertex_base_3<Traits, Base>

Support Classes

CGAL::Kinetic::Enclosing_box_2<Traits>

CGAL::Kinetic::Enclosing_box_3<Traits>

CGAL::Kinetic::Insert_event<ActiveObjectsTable>

CGAL::Kinetic::Erase_event<ActiveObjectsTable>

CGAL::Kinetic::Qt_moving_points_2<Traits, QtWidget_2>

CGAL::Kinetic::Qt_triangulation_2<KineticTriangulation_2, QtWidget_2, QtMovingPoints_2>

CGAL::Kinetic::Qt_widget_2<Simulator>

53.6   Alphabetical List of Reference Pages