|
Class Summary |
| constructHull |
ConstructHull using the Incremental Algorithm (O'Rourke, p. |
| delaunayN2 |
Delaunay Triangulation in 2D in O(n^2) time (O'Rourke, p. |
| delaunayN4 |
Delaunay Triangulation in 2D in O(n^4) time. |
| Edge |
Edge element used to construct 3D polyhedra, in the spririt of
O'Rourke, _Computational Geometry in C_. |
| Face |
Triangular face used to construct 3D polyhedra, in the spririt of
O'Rourke, _Computational Geometry in C_ |
| generate2Ddata |
|
| generateData |
|
| graham |
Graham Scan, (O'Rourke, p. |
| Point |
An n-dimensional geometric point,
with convenience methods for those who prefer to live in 2-, 3-, or 4-D space
and several static methods dealing with small numbers of Points
(in 2D, plus 1 method for 3D). |
| Polygon<PointType extends Point> |
A LinkedList of Points |
| testArea |
Exercise areaPoly2 (O'Rourke, p. |
| TriangleMesh |
An n-D triangular mesh of Points. |
| triangulatePolygon |
Triangulate, (O'Rourke, p. |
| Vector |
An n-dimensional vector, with convenience methods for those who
prefer to live in 2-, 3-, and 4-D space. |
| Vertex |
A 3-dimensioal vertex used to construct polyhedra in the spirit of
O'Rourke, _Computational Geometry in C_. |
| VRML |
Methods to construct a VRML .wrl file to visualize
meshes using Balls and Sticks. |