Package | Description |
---|---|
fr.inria.zvtm.layout.delaunay |
Algorithms for computing geometrical information about sets of points, such as the Delaunay triangulation and Voronoi tessellation.
|
Modifier and Type | Method and Description |
---|---|
Simplex<Pnt> |
DelaunayTriangulation.locate(Pnt point)
Locate the triangle with point (a Pnt) inside (or on) it.
|
Simplex<V> |
Triangulation.neighborOpposite(Object vertex,
Simplex<V> simplex)
Report neighbor opposite the given vertex of simplex.
|
Modifier and Type | Method and Description |
---|---|
Set<Simplex<Pnt>> |
DelaunayTriangulation.delaunayPlace(Pnt site)
Place a new point site into the DT.
|
Iterator<Simplex<V>> |
Triangulation.iterator()
Iterator.
|
Set<Simplex<V>> |
Triangulation.neighbors(Simplex<V> simplex)
Report neighbors of the given simplex.
|
Modifier and Type | Method and Description |
---|---|
boolean |
Triangulation.contains(Simplex<V> simplex)
True iff the simplex is in this Triangulation.
|
boolean |
Simplex.isNeighbor(Simplex<V> simplex)
True iff simplices are neighbors.
|
Simplex<V> |
Triangulation.neighborOpposite(Object vertex,
Simplex<V> simplex)
Report neighbor opposite the given vertex of simplex.
|
Set<Simplex<V>> |
Triangulation.neighbors(Simplex<V> simplex)
Report neighbors of the given simplex.
|
Modifier and Type | Method and Description |
---|---|
static <V> Set<Set<V>> |
Simplex.boundary(Set<? extends Simplex<V>> simplexSet)
Report the boundary of a Set of Simplices.
|
void |
Triangulation.update(Set<? extends Simplex<V>> oldSet,
Set<? extends Simplex<V>> newSet)
Update by replacing one set of Simplices with another.
|
void |
Triangulation.update(Set<? extends Simplex<V>> oldSet,
Set<? extends Simplex<V>> newSet)
Update by replacing one set of Simplices with another.
|
Constructor and Description |
---|
DelaunayTriangulation(Simplex<Pnt> triangle)
Constructor.
|
Triangulation(Simplex<V> simplex)
Constructor.
|
Copyright © 2000-2002 Xerox Corporation. All Rights Reserved
Copyright © 2003 World Wide Web Consortium. All Rights Reserved
Copyright © 2004-2015 INRIA. All Rights Reserved
Licensed under the GNU LGPL. For full terms see the file COPYING.