yade-dev team mailing list archive
-
yade-dev team
-
Mailing list archive
-
Message #02073
new CGAL algorithms
For your information, CGAL 3.5 (beta) includes periodic triangulation
(which means the TriangulationCollider I wrote for Yade can now easily
be extended to periodic geometries), and AABB tree for distance detection.
See http://www.cgal.org/releases.html#release3.5
Bruno
Triangulations and Delaunay Triangulations
3D Periodic Triangulations (new package)
* This package allows to build and handle triangulations of point
sets in the three dimensional flat torus. Triangulations are built
incrementally and can be modified by insertion or removal of
vertices. They offer point location facilities.
[...]
Spatial Searching and Sorting
AABB tree (new package)
* This package implements a hierarchy of axis-aligned bounding boxes
(a AABB tree) for efficient intersection and distance computations
between 3D queries and sets of input 3D geometric objects.
--
_______________
Chareyre Bruno
Maître de Conférences
Grenoble INP
Laboratoire 3SR - bureau E145
BP 53 - 38041, Grenoble cedex 9 - France
Tél : 33 4 56 52 86 21
Fax : 33 4 76 82 70 43
________________
Follow ups