Package | Description |
---|---|
com.mockturtlesolutions.snifflib.util |
Contains some utility classes providing methods of broad applicability.
|
Modifier and Type | Method and Description |
---|---|
RefSimplex |
RefSimplex.getParent() |
RefSimplex |
Triangulation.getSimplex(int idx) |
RefSimplex |
Triangulation.getSimplex(java.lang.Integer index) |
RefSimplex |
Triangulation.MakeFirstSimplex(java.util.LinkedHashMap P,
Triangulation.SplittingPlane alpha,
java.util.LinkedHashMap P1,
java.util.LinkedHashMap P2) |
RefSimplex |
Triangulation.MakeSimplex(RefSimplex face,
java.util.LinkedHashMap P) |
Modifier and Type | Method and Description |
---|---|
void |
Triangulation.VertexTracker.addFace(RefSimplex f) |
java.util.Vector |
Triangulation.faceNeighbors(RefSimplex s)
Returns the simplices neighboring (sharing a face) with the given simplex.
|
boolean |
Triangulation.VertexTracker.hasFace(RefSimplex f) |
boolean |
RefSimplex.hasFace(RefSimplex simp)
Returns true if any of this D simplice's faces are the same as the D-1 simplex given.
|
int |
RefSimplex.intersects(RefSimplex other)
Returns 0 if the given simplex does not intersect with this one.
|
boolean |
Triangulation.SplittingPlane.isIntersectedBy(RefSimplex f) |
int |
Triangulation.ismember(RefSimplex fprime,
java.util.Vector AFL) |
RefSimplex |
Triangulation.MakeSimplex(RefSimplex face,
java.util.LinkedHashMap P) |
boolean |
RefSimplex.sameAs(RefSimplex f)
Returns true if the two simplices have the same vertices - not necessarily in the same order.
|
void |
RefSimplex.setParent(RefSimplex par) |
boolean |
Triangulation.subsetOf(RefSimplex f,
java.util.LinkedHashMap pts)
Determines if every vertex of this simplex belongs in the given set.
|
void |
Triangulation.Update(RefSimplex fprime,
java.util.Vector AFL) |
java.util.Vector |
Triangulation.vertexNeighbors(RefSimplex s)
Returns the simplices neighboring (sharing a face) with the given simplex.
|
Constructor and Description |
---|
RefSimplex.IntersectObjective(RefSimplex simp1,
RefSimplex simp2) |
Copyright © 2011, 2013. Daniel P. Dougherty