This concept ties together the parts needed in order to run a kinetic data structure. We provide several models of this concept:
All support trajectories defined by polynomial coordinates. The Exact vs Inexect picks whether the roots of the certificate functions are compared exactly or approximated numerically. The regular triangulation models have weighted points of the appropriate dimension as the primitive used in the Kinetic::InstantaneousKernel and the Kinetic::ActiveObjectsTable.
| |
The number type used for representation.
| |
| |
A model of
Kinetic::InstantaneousKernel which can be used to apply static CGAL
data structures to snapshots of moving data.
| |
| |
A model of Kinetic::Kernel.
| |
| |
A model of Kinetic::FunctionKernel.
| |
| |
A model of
Kinetic::ActiveObjectsTable which holds the relevant kinetic
primitives.
| |
| |
A model of Kinetic::Simulator which will be
used by all the kinetic data structures.
|
|
| |
Get a new instantaneous kernel. | ||
|
| Get a new kinetic kernel. |
|
| Get a new function kernel. |
|
| Return a pointer to the Kinetic::Simulator which is to be used in the simulation. |
| ||
| Return a pointer to the Kinetic::ActiveObjectsTable which is to be used in the simulation. |
Kinetic::Exact_simulation_traits, Kinetic::Inexact_simulation_traits, Kinetic::Regular_triangulation_exact_simulation_traits, Kinetic::Regular_triangulation_inexact_simulation_traits