class Bridge
extends java.lang.Object
| Constructor and Description |
|---|
Bridge() |
| Modifier and Type | Method and Description |
|---|---|
(package private) static void |
constructBridges(Triangulator triRef,
int loopMin,
int loopMax) |
(package private) static int |
d_comp(Distance a,
Distance b) |
(package private) 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.
|
(package private) static void |
findLeftMostVertex(Triangulator triRef,
int ind,
int[] leftInd,
int[] leftI) |
(package private) static void |
insertBridge(Triangulator triRef,
int ind1,
int i1,
int ind3,
int i3) |
(package private) static int |
l_comp(Left a,
Left b) |
(package private) static void |
simpleBridge(Triangulator triRef,
int ind1,
int ind2) |
(package private) static void |
sortDistance(Distance[] distances,
int numPts) |
(package private) static void |
sortLeft(Left[] lefts,
int numPts) |
static void constructBridges(Triangulator triRef, int loopMin, int loopMax)
static boolean findBridge(Triangulator triRef, int ind, int i, int start, int[] ind1, int[] i1)
static void findLeftMostVertex(Triangulator triRef, int ind, int[] leftInd, int[] leftI)
static void simpleBridge(Triangulator triRef, int ind1, int ind2)
static void insertBridge(Triangulator triRef, int ind1, int i1, int ind3, int i3)
static void sortLeft(Left[] lefts, int numPts)
static void sortDistance(Distance[] distances, int numPts)
Copyright 1996-2008 Sun Microsystems, Inc. All Rights Reserved. Use is subject to license terms.