-
Notifications
You must be signed in to change notification settings - Fork 56
/
triangulate.html
418 lines (377 loc) · 11.2 KB
/
triangulate.html
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
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
<html>
<head>
<title>
TRIANGULATE - Triangulate a Polygonal Region
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
TRIANGULATE <br> Triangulate a Polygonal Region
</h1>
<hr>
<p>
<b>TRIANGULATE</b>
is a MATLAB program which
triangulates a polygonal region.
</p>
<p>
The polygon is defined by an input file which gives the coordinates
of the vertices of the polygon, in counterclockwise order.
</p>
<p>
No consecutive pair of vertices should be equal; when describing a
polygon, sometimes the first and last vertices are equal. For this
program, that is not the case. To describe a square, your input
file should contain four pairs of coordinates, for instance.
</p>
<p>
The vertices should be listed in counterclockwise order. If you list
them in clockwise order, then the area will probably come out negative.
The program will retry the calculation by reversing the order of the
vertices.
</p>
<p>
It is possible to create a "polygon" that has zero area. The program
will refuse to process such an object.
</p>
<p>
The polygon does not need to be convex. However, you should be careful
not to specify a polygon which crosses itself, since this means the
interior of the polygon is not well defined, and hence a triangulation
is not well defined. As a simple example of such a problem, consider
the four vertices of a square in counterclockwise order: V1, V2, V3, V4,
and list them instead as V1, V3, V2, V4. This shape cannot be triangulated.
</p>
<p>
The output of the program is a list of the "diagonal lines"
defined by pairs of vertices which constitute the triangulation,
a list of the nodes that form the triangles of the triangulation,
and an image of the triangulated polygon.
</p>
<p>
The program is based on a C program by Joseph ORourke.
</p>
<h3 align = "center">
Usage:
</h3>
<p>
<blockquote>
<b>triangulate</b> ( <i>'prefix'</i>, <i>'animate'</i> )
</blockquote>
where
<ul>
<li>
<i>'prefix'</i> is the filename prefix,
</li>
<li>
<i>'animate'</i> (optional argument) is 'y' if you want to
see the process animated;
</li>
</ul>
reads the file
<ul>
<li>
<i>'prefix'</i><b>_nodes.txt</b>, containing the vertex coordinates,
</li>
</ul>
and writes the files
<ul>
<li>
<i>'prefix'</i><b>_diagonals.txt</b> listing N-3 pairs of vertices that
form the internal diagonals of the triangulation.
</li>
<li>
<i>'prefix'</i><b>_elements.txt</b> listing N-2 triples of vertices that
form the triangles of the triangulation.
</li>
</ul>
</p>
<h3 align = "center">
Licensing:
</h3>
<p>
The computer code and data files described and made available on this web page
are distributed under
<a href = "../../txt/gnu_lgpl.txt">the GNU LGPL license.</a>
</p>
<h3 align = "center">
Languages:
</h3>
<p>
<b>TRIANGULATE</b> is available in
<a href = "../../c_src/triangulate/triangulate.html">a C version</a> and
<a href = "../../m_src/triangulate/triangulate.html">a MATLAB version</a>.
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../m_src/convex_hull/convex_hull.html">
CONVEX_HULL</a>,
a MATLAB program which
demonstrates the computation of the convex hull of a set of 2D points.
</p>
<p>
<a href = "../../m_src/hand_data/hand_data.html">
HAND_DATA</a>,
MATLAB programs which
carry out some numerical exercises based on data that came from
tracing several points on a person's hand.
</p>
<p>
<a href = "../../datasets/polygon/polygon.html">
POLYGON</a>,
a dataset directory which
contains examples of polygons.
</p>
<p>
<a href = "../../c_src/triangle/triangle.html">
TRIANGLE</a>,
a C program which
triangulates a set of points.
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ul>
<li>
Joseph ORourke,<br>
Computational Geometry in C,<br>
Second Edition,<br>
Cambridge, 1998,<br>
ISBN: 0521649765,<br>
LC: QA448.D38.
</li>
</ul>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "triangulate.m">triangulate.m</a>
the source code.
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<b>COMB</b> is an example of a "comb" polygon of 10 vertices
<ul>
<li>
<a href = "comb_nodes.txt">comb_nodes.txt</a>,
the vertex coordinates.
</li>
<li>
<a href = "comb.png">comb.png</a>,
a PNG image of the polygon.
</li>
<li>
<a href = "comb_triangulated.png">comb_triangulated.png</a>,
a PNG image of the triangulated polygon.
</li>
<li>
<a href = "comb_output.txt">comb_output.txt</a>,
the output file.
</li>
<li>
<a href = "comb_diagonals.txt">comb_diagonals.txt</a>,
the internal diagonal edges.
</li>
<li>
<a href = "comb_elements.txt">comb_elements.txt</a>,
the triangles that make up the polygon.
</li>
</ul>
</p>
<p>
<b>HAND</b> outlines a hand using 59 vertices.
<ul>
<li>
<a href = "hand_nodes.txt">hand_nodes.txt</a>,
the vertex coordinates.
</li>
<li>
<a href = "hand.png">hand.png</a>,
a PNG image of the polygon.
</li>
<li>
<a href = "hand_triangulated.png">hand_triangulated.png</a>,
a PNG image of the triangulated polygon.
</li>
<li>
<a href = "hand_output.txt">hand_output.txt</a>,
the output file.
</li>
<li>
<a href = "hand_diagonals.txt">hand_diagonals.txt</a>,
the internal diagonal edges.
</li>
<li>
<a href = "hand_elements.txt">hand_elements.txt</a>,
the triangles that make up the polygon.
</li>
</ul>
</p>
<p>
<b>I18</b> is an example of a complicated nonconvex polygon, using 18 vertices.
<ul>
<li>
<a href = "i18_nodes.txt">i18_nodes.txt</a>,
the vertex coordinates.
</li>
<li>
<a href = "i18.png">i18.png</a>,
a PNG image of the polygon.
</li>
<li>
<a href = "i18_triangulated.png">i18_triangulated.png</a>,
a PNG image of the triangulated polygon.
</li>
<li>
<a href = "i18_output.txt">i18_output.txt</a>,
the output file.
</li>
<li>
<a href = "i18_diagonals.txt">i18_diagonals.txt</a>,
the diagonal edges.
</li>
<li>
<a href = "i18_elements.txt">i18_elements.txt</a>,
the triangles that make up the polygon.
</li>
</ul>
</p>
<p>
<b>SNAKE</b> is an example defining a "snake" polygon using 12 vertices.
<ul>
<li>
<a href = "snake_nodes.txt">snake_nodes.txt</a>,
the vertex coordinates.
</li>
<li>
<a href = "snake.png">snake.png</a>,
a PNG image of the polygon.
</li>
<li>
<a href = "snake_triangulated.png">snake_triangulated.png</a>,
a PNG image of the triangulated polygon.
</li>
<li>
<a href = "snake_output.txt">snake_output.txt</a>,
the output file.
</li>
<li>
<a href = "snake_diagonals.txt">snake_diagonals.txt</a>,
the diagonal edges.
</li>
<li>
<a href = "snake_elements.txt">snake_elements.txt</a>,
the triangles that make up the polygon.
</li>
</ul>
</p>
<p>
<b>SQUARE</b> is an example defining a square, using 4 vertices.
<ul>
<li>
<a href = "square_nodes.txt">square_nodes.txt</a>,
the vertex coordinates.
</li>
<li>
<a href = "square.png">square.png</a>,
a PNG image of the polygon.
</li>
<li>
<a href = "square_triangulated.png">square_triangulated.png</a>,
a PNG image of the triangulated polygon.
</li>
<li>
<a href = "square_output.txt">square_output.txt</a>,
the output file.
</li>
<li>
<a href = "square_diagonals.txt">square_diagonals.txt</a>,
the diagonal edges.
</li>
<li>
<a href = "square_elements.txt">square_elements.txt</a>,
the triangles that make up the polygon.
</li>
</ul>
</p>
<p>
<b>TE53</b> is an example in which the vertices have been (incorrectly)
listed in clockwise order. The program detects this problem and reverses
the ordering before proceeding. The example uses 26 vertices.
<ul>
<li>
<a href = "te53_nodes.txt">te53_nodes.txt</a>,
the vertex coordinates.
</li>
<li>
<a href = "te53.png">te53.png</a>,
a PNG image of the polygon.
</li>
<li>
<a href = "te53_triangulated.png">te53_triangulated.png</a>,
a PNG image of the triangulated polygon.
</li>
<li>
<a href = "te53_output.txt">te53_output.txt</a>,
the output file.
</li>
<li>
<a href = "te53_diagonals.txt">te53_diagonals.txt</a>,
the diagonal edges.
</li>
<li>
<a href = "te53_elements.txt">te53_elements.txt</a>,
the triangles that make up the polygon.
</li>
</ul>
</p>
<p>
<b>TRIANGLE</b> is an example defining a triangle, using 3 vertices.
<ul>
<li>
<a href = "triangle_nodes.txt">triangle_nodes.txt</a>,
the vertex coordinates.
</li>
<li>
<a href = "triangle.png">triangle.png</a>,
a PNG image of the polygon.
</li>
<li>
<a href = "triangle_triangulated.png">triangle_triangulated.png</a>,
a PNG image of the triangulated polygon.
</li>
<li>
<a href = "triangle_output.txt">triangle_output.txt</a>,
the output file.
</li>
<li>
<a href = "triangle_diagonals.txt">triangle_diagonals.txt</a>,
the diagonal edges.
</li>
<li>
<a href = "triangle_elements.txt">triangle_elements.txt</a>,
the triangles that make up the polygon.
</li>
</ul>
</p>
<p>
You can go up one level to <a href = "../m_src.html">
the MATLAB source codes</a>.
</p>
<hr>
<i>
Last revised on 03 January 2013.
</i>
<!-- John Burkardt -->
</body>
</html>