summaryrefslogtreecommitdiffstats
path: root/voronoi/cVertexList.java
blob: bcd6fe47b8ec2ce7df9a68f4fd535776a699aecb (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
package voronoi;

import java.awt.Color;
import java.awt.Graphics;

/**
 * Speichert verteces (Eckpunkte, Knoten, Punkte...)
 * 
 * @author
 * 
 */
class cVertexList {
	int n; // 0 means empty; 1 means one vertex; etc.

	int j;

	cVertex head;

	cVertexList() {
		head = null;
		n = 0;
	}

	public cVertex GetElement(int index) {

		cVertex v = new cVertex();
		if (index <= n) {
			v = head;
			for (int i = 0; i < index; i++)
				v = v.next;

		} else
			// element not found
			v = new cVertex(10000, 10000);

		return v;
	}

	public cVertex MakeNullVertex() {
		cVertex v = new cVertex();
		InsertBeforeHead(v);
		return v;
	}

	public void InitHead(cVertex h) {
		head = new cVertex();
		head = h;
		head.next = head.prev = head;
		n = 1;
	}

	public void ClearVertexList() {
		if (head != null)
			head = null;
		n = 0;
	}

	public void InsertBeforeHead(cVertex ver) {
		if (head == null)
			InitHead(ver);
		else {
			InsertBefore(ver, head);
		}
	}

	public void InsertBefore(cVertex newV, cVertex oldV) {
		if (head == null)
			InitHead(newV);
		else {
			oldV.prev.next = newV;
			newV.prev = oldV.prev;
			newV.next = oldV;
			oldV.prev = newV;
			n++;
		}
	}

	public void SetVertex(int x, int y) {
		cVertex v = new cVertex(x, y);
		InsertBeforeHead(v);
	}

	public void AddVertex(int x, int y) {
		cVertex v = new cVertex(x, y);
		// gets vertex of 1st vertex of the closest edge to the point
		cVertex vNear = GetEdge(x, y);
		if (vNear != null)
			InsertBefore(v, vNear.next);
	}

	public void ResetVertex(cVertex resV, int x, int y) {
		resV.v.x = x;
		resV.v.y = y;
	}

	public void ResetVertex(cVertex resV, int x, int y, int vnum, boolean mark) {
		resV.v.x = x;
		resV.v.y = y;
		resV.vnum = vnum;
		resV.mark = mark;
	}

	public void Delete(cVertex ver) {
		if (head == head.next)
			head = null;
		else if (ver == head)
			head = head.next;

		ver.prev.next = ver.next;
		ver.next.prev = ver.prev;
		n--;
	}

	public void ListPart(cVertexList list, int j) {
		int i = j;
		cVertex temp1 = head, temp2;
		do {
			i--;
			temp2 = new cVertex(); // Create a new vertex cell
			temp2.v = temp1.v; // Fill it with the same cPointi as in list
			temp2.mark = temp1.mark;
			temp2.ear = temp1.ear;
			temp2.duplicate = temp1.duplicate;
			temp2.onhull = temp1.onhull;
			temp2.vnum = temp1.vnum;
			list.InsertBeforeHead(temp2);
			temp1 = temp1.next;
		} while (i >= 0);
	}

	public void ListCopy(cVertexList list) {
		cVertex temp1 = head, temp2;
		do {
			temp2 = new cVertex(); // Create a new vertex cell
			temp2.v = temp1.v; // Fill it with the same cPointi as in list
			temp2.mark = temp1.mark;
			temp2.ear = temp1.ear;
			temp2.duplicate = temp1.duplicate;
			temp2.onhull = temp1.onhull;
			temp2.vnum = temp1.vnum;
			list.InsertBeforeHead(temp2);
			temp1 = temp1.next;
		} while (temp1 != head);
	}

	public cVertex GetNearVertex(int x, int y) {
		cVertex vnear = null, vtemp = head;
		double dist = -1.0, dx, dy, mindist = 0.0;

		if (vtemp == null)
			return vnear;

		do {
			dx = vtemp.v.x - x;
			dy = vtemp.v.y - y;
			dist = dx * dx + dy * dy;

			// Initialize on first pass (when vnear==null);
			// otherwise update if new winner
			if (vnear == null || dist < mindist) {
				mindist = dist;
				vnear = vtemp;
			}
			vtemp = vtemp.next;
		} while (vtemp != head);

		return vnear;
	}

	public cVertex FindVertex(int x, int y, int w, int h) {
		cVertex notfound = null;
		cVertex temp = head;

		if (n > 0) {
			do {
				temp = temp.next;
				if ((temp.v.x <= x + (w / 2)) && (temp.v.x >= x - (w / 2))
						&& (temp.v.y <= y + (h / 2))
						&& (temp.v.y >= y - (h / 2)))
					return temp;
			} while (temp != head);
		}
		return notfound;
	}

	public cVertex GetEdge(int x, int y) {
		cVertex vnear = null, vtemp = head;
		double mindist = 0.0, dist = -1.0;
		cPointi p = new cPointi();

		// input query point
		p.x = x;
		p.y = y;

		if (vtemp == null)
			return vnear;

		do {
			dist = p.DistEdgePoint(vtemp.v, vtemp.next.v, p);
			if (vnear == null || dist < mindist) {
				mindist = dist;
				vnear = vtemp;
			}
			vtemp = vtemp.next;
		} while (vtemp != head);

		return vnear;
	}

	/**
	 * zeichnet die vertices
	 * 
	 * @param g
	 * @param w
	 * @param h
	 */
	public void DrawPoints(Graphics g, int w, int h) {
		// vertex painting loop
		if (n == 0)
			System.out.println("No drawing is possible.");
		else {
			cVertex v = head;

			g.setColor(Color.black);
			do {
				g.fillOval(v.v.x - (int) (w / 2), v.v.y - (int) (h / 2), w, h);
				v = v.next;
			} while (v != head.prev);
			g.fillOval(v.v.x - (int) (w / 2), v.v.y - (int) (h / 2), w, h);
		}
	}

}