| java.lang.Object com.sun.j3d.utils.geometry.Bridge
Method Summary | |
static void | constructBridges(Triangulator triRef, int loopMin, int loopMax) | static int | d_comp(Distance a, Distance b) | static boolean | findBridge(Triangulator triRef, int ind, int i, int start, int[] ind1, int[] i1) We try to find a vertex i1 on the loop which contains i such that i1
is close to start, and such that i1, start is a valid diagonal. | static void | findLeftMostVertex(Triangulator triRef, int ind, int[] leftInd, int[] leftI) | static void | insertBridge(Triangulator triRef, int ind1, int i1, int ind3, int i3) | static int | l_comp(Left a, Left b) | static void | simpleBridge(Triangulator triRef, int ind1, int ind2) | static void | sortDistance(Distance[] distances, int numPts) | static void | sortLeft(Left[] lefts, int numPts) |
constructBridges | static void constructBridges(Triangulator triRef, int loopMin, int loopMax)(Code) | | |
findBridge | static boolean findBridge(Triangulator triRef, int ind, int i, int start, int[] ind1, int[] i1)(Code) | | We try to find a vertex i1 on the loop which contains i such that i1
is close to start, and such that i1, start is a valid diagonal.
|
findLeftMostVertex | static void findLeftMostVertex(Triangulator triRef, int ind, int[] leftInd, int[] leftI)(Code) | | |
insertBridge | static void insertBridge(Triangulator triRef, int ind1, int i1, int ind3, int i3)(Code) | | |
sortDistance | static void sortDistance(Distance[] distances, int numPts)(Code) | | |
sortLeft | static void sortLeft(Left[] lefts, int numPts)(Code) | | |
|
|