\( \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.9 - Kinetic Data Structures
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Kinetic Data Structures Reference

kdsDetail.png
Daniel Russel
Kinetic data structures allow combinatorial structures to be maintained as the primitives move. The package provides implementations of kinetic data structures for Delaunay triangulations in two and three dimensions, sorting of points in one dimension and regular triangulations in three dimensions. The package supports exact or inexact operations on primitives which move along polynomial trajectories.


Introduced in: CGAL 3.2
BibTeX: cgal:r-kds-16b
License: LGPL

Classified Reference Pages

Sorting

Delaunay Triangulation in 2D

Delaunay and Regular Triangulations in 3D

Support Classes

Modules

 Concepts
 
 Sorting
 
 Delaunay Triangulation in 2D
 
 Delaunay and Regular Triangulations in 3D
 
 Support Classes