|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||
See:
Description
| Class Summary | |
|---|---|
| DelaunayTriangulation | A 2D Delaunay Triangulation (DT) with incremental site insertion. |
| Pnt | Points in Euclidean space, implemented as double[]. |
| Simplex<V> | A Simplex is an immutable set of vertices (usually Pnts). |
| Triangulation<V> | A Triangulation on vertices (generic type V). |
Algorithms for computing geometrical information about sets of points, such as the Delaunay triangulation and Voronoi tessellation.
|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||