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

Definition

The class Kinetic::Regular_triangulation_3<Traits, Visitor, Triangulation> maintains a triangulation of set of moving weighted points. Its interface is the same as Kinetic::Delaunay_triangulation_3<Traits, Visitor, Triangulation>.

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.

#include <CGAL/Kinetic/Regular_triangulation_3.h>

See Also

Example

File: examples/Kinetic_data_structures/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(int, char *[]) {
    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);
    in >> *tr.active_points_3_table_handle();

    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;
};