|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectjavamorph.CTriangulation
public class CTriangulation
| Field Summary | |
|---|---|
private static double |
center_x
Center x of the circumcircle of the triangle to test. |
private static double |
center_y
Center y of the circumcircle of the triangle to test. |
private static double |
circle_radius
Due to DELAUNAY. |
private static int |
count
Count of found new point relating to the line. |
private static int |
height
Height of the picture. |
private static Vector<Point> |
order
Collection of all input points, order not modified. |
private static Point |
p1
First point of the line to explore. |
private static Point |
p2
Second point of the line to explore. |
private static Point |
pnew
Point to test relating to the line: No other point shall lay nearer. |
private static HashSet<Point> |
points
Collection of all unique input points. |
private static Queue<Point[]> |
queue
Queue of explored points which have to be processed. |
private static HashSet<CTriangle> |
triangles
Result of the process is this triangulation. |
private static HashSet<CLine> |
used
Collection of lines which have already been processed. |
private static int |
width
Width of the picture. |
| Constructor Summary | |
|---|---|
CTriangulation()
|
|
| Method Summary | |
|---|---|
private static void |
add(CTriangle temp)
Add one left & one right triangle. |
private static boolean |
circle()
Calculates the circumcircle of the current test triangle's points. |
private static void |
clear()
Clear all permanent date of the collections. |
private static void |
debug()
Write left right and 50% triangulation into the debug directory. |
private static boolean |
delaunayCond()
Check the DELAUNAY condition of P1 P2 and PNEW. |
private static double |
distance(Point p)
Distance of one point to the center of the circumcircle. |
private static Point |
findNearest(Point p1)
Find the nearest neighbor of one mesh point. |
private static void |
findPoint()
Explore the third points for one line. |
private static int |
indexOf(Point p)
Seek one point within the ordered input list. |
static void |
triangulate()
Perform complete operation. |
private static void |
work()
Calculate the triangles. |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
private static int width
private static int height
private static final Vector<Point> order
private static final HashSet<Point> points
private static final HashSet<CLine> used
private static final Queue<Point[]> queue
private static final HashSet<CTriangle> triangles
private static double circle_radius
private static double center_x
private static double center_y
private static Point p1
private static Point p2
private static Point pnew
private static int count
| Constructor Detail |
|---|
public CTriangulation()
| Method Detail |
|---|
public static void triangulate()
private static void clear()
private static void work()
private static void findPoint()
private static void add(CTriangle temp)
temp - Input triangle.private static int indexOf(Point p)
p - Point to seek.
private static boolean delaunayCond()
true if DELAUNAY condition is satisfied.private static Point findNearest(Point p1)
p1 - First point.
private static boolean circle()
true if such a circle can be found.private static double distance(Point p)
p - Point to be explored.
private static void debug()
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||