|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectorg.openjump.core.graph.delauneySimplexInsert.Triangulation
public class Triangulation
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.
| Constructor Summary | |
|---|---|
Triangulation(org.openjump.core.graph.delauneySimplexInsert.Simplex simplex)
Constructor. |
|
| Method Summary | |
|---|---|
boolean |
contains(org.openjump.core.graph.delauneySimplexInsert.Simplex simplex)
True iff the simplex is in this Triangulation. |
java.util.Iterator |
iterator()
Iterator. |
org.openjump.core.graph.delauneySimplexInsert.Simplex |
neighborOpposite(java.lang.Object vertex,
org.openjump.core.graph.delauneySimplexInsert.Simplex simplex)
Report neighbor opposite the given vertex of simplex. |
java.util.Set |
neighbors(org.openjump.core.graph.delauneySimplexInsert.Simplex simplex)
Report neighbors of the given simplex. |
void |
printStuff()
Print stuff about a Triangulation. |
int |
size()
Size (# of Simplices) in Triangulation. |
java.lang.String |
toString()
String representation. |
void |
update(java.util.Set oldSet,
java.util.Set newSet)
Update by replacing one set of Simplices with another. |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Constructor Detail |
|---|
public Triangulation(org.openjump.core.graph.delauneySimplexInsert.Simplex simplex)
simplex - the initial Simplex.| Method Detail |
|---|
public java.lang.String toString()
toString in class java.lang.Objectpublic int size()
public boolean contains(org.openjump.core.graph.delauneySimplexInsert.Simplex simplex)
simplex - the simplex to check
public java.util.Iterator iterator()
public void printStuff()
public org.openjump.core.graph.delauneySimplexInsert.Simplex neighborOpposite(java.lang.Object vertex,
org.openjump.core.graph.delauneySimplexInsert.Simplex simplex)
vertex - a vertex of simplexsimplex - we want the neighbor of this Simplex
java.lang.IllegalArgumentException - if vertex is not in this Simplexpublic java.util.Set neighbors(org.openjump.core.graph.delauneySimplexInsert.Simplex simplex)
simplex - a Simplex
public void update(java.util.Set oldSet,
java.util.Set newSet)
oldSet - set of Simplices to be replacednewSet - set of replacement Simplices
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||