public class IntersectionFactory
extends java.lang.Object
| Constructor and Description | 
|---|
| IntersectionFactory() | 
| Modifier and Type | Method and Description | 
|---|---|
| static <A,B> DirectedGraph<A,B> | buildConnectivityGraph(B[] nodeList,
                      boolean[][] cChart) | 
| static DirectedGraph<int[],java.lang.Integer> | buildConnectivityGraph(boolean[][] cChart) | 
| static <A,B> DirectedGraph<A,B> | buildConnectivityGraph(java.util.List<B> nodeList,
                      boolean[][] cChart) | 
| static boolean[][] | buildIntersectionChart(BSPTree[] bspList) | 
| static boolean[][] | buildIntersectionChart(PolygonalMesh[] meshList,
                      double tol) | 
| static boolean[][] | buildIntersectionChart(Sphere[] sphereList) | 
| static void | buildSpatialPartition(DirectedGraph<BSPTree,BSPTree> graph,
                     BSPTree base) | 
public static <A,B> DirectedGraph<A,B> buildConnectivityGraph(B[] nodeList, boolean[][] cChart)
public static <A,B> DirectedGraph<A,B> buildConnectivityGraph(java.util.List<B> nodeList, boolean[][] cChart)
public static DirectedGraph<int[],java.lang.Integer> buildConnectivityGraph(boolean[][] cChart)
public static boolean[][] buildIntersectionChart(Sphere[] sphereList)
public static boolean[][] buildIntersectionChart(BSPTree[] bspList)
public static boolean[][] buildIntersectionChart(PolygonalMesh[] meshList, double tol)
public static void buildSpatialPartition(DirectedGraph<BSPTree,BSPTree> graph, BSPTree base)