| Package | Description |
|---|---|
| com.intersult.ai.convex |
| Modifier and Type | Method and Description |
|---|---|
ConvexSet.Vertex |
ConvexSet.add(T value) |
ConvexSet.Vertex |
ConvexSet.find(T value) |
ConvexSet.Vertex |
ConvexSet.Vertex.find(T value) |
ConvexSet.Vertex |
LinearSearch.getBest() |
| Modifier and Type | Method and Description |
|---|---|
List<ConvexSet.Vertex> |
Collector.get() |
List<ConvexSet.Vertex> |
ConvexSet.Vertex.getEdges() |
| Modifier and Type | Method and Description |
|---|---|
void |
ConvexSet.connect(ConvexSet.Vertex left,
ConvexSet.Vertex right) |
void |
ConvexSet.connect(ConvexSet.Vertex left,
ConvexSet.Vertex right) |
boolean |
ConvexSet.connected(ConvexSet.Vertex left,
ConvexSet.Vertex right) |
boolean |
ConvexSet.connected(ConvexSet.Vertex left,
ConvexSet.Vertex right) |
<T> boolean |
SphereCriterion.convex(ConvexSet.Vertex a,
ConvexSet.Vertex b,
ConvexSet.Vertex test)
Determine if this know lies in the sphere between knot a and knot b.
|
<T> boolean |
SphereCriterion.convex(ConvexSet.Vertex a,
ConvexSet.Vertex b,
ConvexSet.Vertex test)
Determine if this know lies in the sphere between knot a and knot b.
|
<T> boolean |
SphereCriterion.convex(ConvexSet.Vertex a,
ConvexSet.Vertex b,
ConvexSet.Vertex test)
Determine if this know lies in the sphere between knot a and knot b.
|
<T> boolean |
LenseCriterion.convex(ConvexSet.Vertex a,
ConvexSet.Vertex b,
ConvexSet.Vertex test)
Determine if this know lies in the spherical lense between knot a and knot b.
|
<T> boolean |
LenseCriterion.convex(ConvexSet.Vertex a,
ConvexSet.Vertex b,
ConvexSet.Vertex test)
Determine if this know lies in the spherical lense between knot a and knot b.
|
<T> boolean |
LenseCriterion.convex(ConvexSet.Vertex a,
ConvexSet.Vertex b,
ConvexSet.Vertex test)
Determine if this know lies in the spherical lense between knot a and knot b.
|
<T> boolean |
Criterion.convex(ConvexSet.Vertex a,
ConvexSet.Vertex b,
ConvexSet.Vertex test)
Test if the value to test could be pseudo convex, if a and b lies on a convex hull.
|
<T> boolean |
Criterion.convex(ConvexSet.Vertex a,
ConvexSet.Vertex b,
ConvexSet.Vertex test)
Test if the value to test could be pseudo convex, if a and b lies on a convex hull.
|
<T> boolean |
Criterion.convex(ConvexSet.Vertex a,
ConvexSet.Vertex b,
ConvexSet.Vertex test)
Test if the value to test could be pseudo convex, if a and b lies on a convex hull.
|
void |
ConvexSet.disconnect(ConvexSet.Vertex left,
ConvexSet.Vertex right) |
void |
ConvexSet.disconnect(ConvexSet.Vertex left,
ConvexSet.Vertex right) |
void |
ConvexSet.Vertex.reorganize(ConvexSet<T> set,
ConvexSet.Vertex vertex) |
boolean |
ConvexSet.Vertex.vertex(ConvexSet.Vertex a,
ConvexSet.Vertex b) |
boolean |
ConvexSet.Vertex.vertex(ConvexSet.Vertex a,
ConvexSet.Vertex b) |
void |
Stats.visit(ConvexSet.Vertex convex) |
void |
Debug.visit(ConvexSet.Vertex convex) |
void |
Visitor.visit(ConvexSet.Vertex convex) |
void |
LinearSearch.visit(ConvexSet.Vertex convex) |
void |
Collector.visit(ConvexSet.Vertex convex) |
Copyright © 2014 Intersult GmbH. All rights reserved.