| java.lang.Object com.sun.j3d.utils.geometry.Desperate
Desperate | class Desperate (Code) | | |
Method Summary | |
static boolean | desperate(Triangulator triRef, int ind, int i, boolean[] splitted) the functions in this file try to ensure that we always end up with
something that (topologically) is a triangulation. | static boolean | existsCrossOver(Triangulator triRef, int ind, int[] ind1, int[] i1, int[] ind2, int[] i2, int[] ind3, int[] i3, int[] ind4, int[] i4) | static boolean | existsSplit(Triangulator triRef, int ind, int[] ind1, int[] i1, int[] ind2, int[] i2) | static boolean | foundSplit(Triangulator triRef, int ind5, int i5, int ind, int ind1, int i1, int i3, int i4, int[] ind2, int[] i2) | static void | handleCrossOver(Triangulator triRef, int ind1, int i1, int ind2, int i2, int ind3, int i3, int ind4, int i4) | static void | handleSplit(Triangulator triRef, int ind1, int i1, int ind3, int i3) | static boolean | letsHope(Triangulator triRef, int ind) | static int | windingNumber(Triangulator triRef, int ind, Point2f p) This function computes the winding number of a polygon with respect to a
point p. |
desperate | static boolean desperate(Triangulator triRef, int ind, int i, boolean[] splitted)(Code) | | the functions in this file try to ensure that we always end up with
something that (topologically) is a triangulation.
the more desperate we get, the more aggressive means we choose for making
diagonals "valid".
|
existsCrossOver | static boolean existsCrossOver(Triangulator triRef, int ind, int[] ind1, int[] i1, int[] ind2, int[] i2, int[] ind3, int[] i3, int[] ind4, int[] i4)(Code) | | |
existsSplit | static boolean existsSplit(Triangulator triRef, int ind, int[] ind1, int[] i1, int[] ind2, int[] i2)(Code) | | |
foundSplit | static boolean foundSplit(Triangulator triRef, int ind5, int i5, int ind, int ind1, int i1, int i3, int i4, int[] ind2, int[] i2)(Code) | | |
handleCrossOver | static void handleCrossOver(Triangulator triRef, int ind1, int i1, int ind2, int i2, int ind3, int i3, int ind4, int i4)(Code) | | |
handleSplit | static void handleSplit(Triangulator triRef, int ind1, int i1, int ind3, int i3)(Code) | | |
windingNumber | static int windingNumber(Triangulator triRef, int ind, Point2f p)(Code) | | This function computes the winding number of a polygon with respect to a
point p. no care is taken to handle cases where p lies on the
boundary of the polygon. (this is no issue in our application, as we will
always compute the winding number with respect to the mid-point of a
valid diagonal.)
|
|
|