| org.openjump.core.graph.delauneySimplexInsert |
|
| Java Source File Name | Type | Comment |
| DelaunayTriangulation.java | Class | A 2D Delaunay Triangulation (DT) with incremental site insertion.
This is not the fastest way to build a DT, but it's a reasonable way
to build the DT incrementally and it makes a nice interactive display.
There are several O(n log n) methods, but they require that either (1)
the sites are all known initially or (2) the sites are inserted in random
order.
author:
Paul Chew
author:
Created July 2005. |
| DTriangulationForJTS.java | Class |
author:
sstein
author:
Use the class to access the delauney trinagulation by L. |
| Pnt.java | Class | Points in Euclidean space, implemented as double[].
Includes simple geometric operations.
Uses matrices; a matrix is represented as an array of Pnts.
Uses simplices; a simplex is represented as an array of Pnts.
author:
Paul Chew
author:
Created July 2005. |
| Simplex.java | Class | A Simplex is an immutable set of vertices (usually Pnts).
author:
Paul Chew
author:
Created July 2005. |
| Triangulation.java | Class | A Triangulation on vertices (generic type V).
A Triangulation is a set of Simplices (see Simplex below).
For efficiency, we keep track of the neighbors of each Simplex.
Two Simplices are neighbors of they share a facet.
author:
Paul Chew
author:
Created July 2005. |