CGAL 4.7 - Kinetic Data Structures: CGAL::Kinetic::Regular_triangulation_3< Traits, Visitor, Triangulation > Class Template Reference

\( \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.7 - Kinetic Data Structures

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
CGAL::Kinetic::Regular_triangulation_3< Traits, Visitor, Triangulation > Class Template Reference
Delaunay and Regular Triangulations in 3D

`#include <CGAL/Kinetic/Regular_triangulation_3.h>`

## Definition

The class `Kinetic::Regular_triangulation_3` maintains a triangulation of set of moving weighted points.

Its interface is the same as `Kinetic::Delaunay_triangulation_3<Traits, Visitor, Triangulation>`.

Note that the regular triangulation tracks as points are added to the `Kinetic::ActiveObjectsTable`, but not removed from it.

The optional `Triangulation` template argument must be a model of `CGAL::RegularTriangulation_3` which has `Kinetic::Regular_triangulation_cell_base_3<Traits, Base>` as a cell base and `Kinetic::Regular_triangulation_vertex_base_3<Traits, Base>` as a vertex base.

See Also
  `Kinetic::Delaunay_triangulation_3<Traits, Visitor, Triangulation>`
  `Kinetic::RegularTriangulationVisitor_3`

Example

File Kinetic_data_structures/Kinetic_regular_triangulation_3.cpp

#define CGAL_CHECK_EXACTNESS
#define CGAL_CHECK_EXPENSIVE
#include <CGAL/Kinetic/Regular_triangulation_exact_simulation_traits.h>
#include <CGAL/Kinetic/Regular_triangulation_3.h>
int main()
{
typedef CGAL::Kinetic::Regular_triangulation_exact_simulation_traits Traits;
typedef CGAL::Kinetic::Regular_triangulation_3<Traits> KDel;
Traits tr(0,100000.0);
KDel kdel(tr);
Traits::Simulator::Handle sp= tr.simulator_handle();
std::ifstream in("data/weighted_points_3");
CGAL_assertion(in.good());
in >> *tr.active_points_3_table_handle();
CGAL_assertion(!in.fail());
std::cout << *tr.active_points_3_table_handle();
std::cout << *tr.active_points_3_table_handle() << std::endl;
kdel.set_has_certificates(true);
sp->set_current_event_number(10000);
return EXIT_SUCCESS;
}

Examples:
  Kinetic_data_structures/Kinetic_regular_triangulation_3.cpp.