forked from johannesgerer/jburkardt-cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
table_delaunay.html
377 lines (340 loc) · 10.1 KB
/
table_delaunay.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
<html>
<head>
<title>
TABLE_DELAUNAY - Triangulate Points in 2D
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
TABLE_DELAUNAY <br> Triangulate Points in 2D
</h1>
<hr>
<p>
<b>TABLE_DELAUNAY</b>
is a C++ program which
computes the Delaunay triangulation of a set of points in the plane.
</p>
<p>
Specifically, <b>TABLE_DELAUNAY</b> reads a data file of node coordinates,
computes the Delaunay triangulation of those points, and writes a
triangle file listing the indices of nodes that form each triangle.
</p>
<h3 align = "center">
Usage:
</h3>
<p>
<blockquote>
<b>table_delaunay</b> <i>prefix</i>
</blockquote>
where <i>prefix</i> is the common prefix for the node and triangle files,
<ul>
<li>
<i>prefix</i><b>_nodes.txt</b>, the node coordinate file (input).
</li>
<li>
<i>prefix</i><b>_elements.txt</b>, the element file (output).
</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>TABLE_DELAUNAY</b> is available in
<a href = "../../cpp_src/table_delaunay/table_delaunay.html">a C++ version</a> and
<a href = "../../f_src/table_delaunay/table_delaunay.html">a FORTRAN90 version</a> and
<a href = "../../m_src/table_delaunay/table_delaunay.html">a MATLAB version</a>.
</p>
<h3 align = "center">
Related Programs:
</h3>
<p>
<a href = "../../f_src/delaunay_lmap_2d/delaunay_lmap_2d.html">
DELAUNAY_LMAP_2D</a>,
a FORTRAN90 program that
computes the Delaunay triangulation of points
in the plane under a linear mapping.
</p>
<p>
<a href = "../../cpp_src/geompack/geompack.html">
GEOMPACK</a>,
a C++ library which
computes the Delaunay triangulation.
</p>
<p>
<a href = "../../f_src/stripack/stripack.html">
STRIPACK</a>,
a FORTRAN90 library which
computes the Delaunay triangulation or Voronoi diagram
of points on a sphere.
</p>
<p>
<a href = "../../data/table/table.html">
TABLE</a>,
a file format which
is used for the input to this program.
</p>
<p>
<a href = "../../cpp_src/table_io/table_io.html">
TABLE_IO</a>,
a C++ library which
supplies the routines used to read the TABLE file.
</p>
<p>
<a href = "../../f_src/table_tet_mesh/table_tet_mesh.html">
TABLE_TET_MESH</a>,
a FORTRAN90 program which
can read a table file of 3D data, and compute a
tetrahedral mesh.
</p>
<p>
<a href = "../../cpp_src/table_voronoi/table_voronoi.html">
TABLE_VORONOI</a>,
a C++ program which
can be used to compute information about the Voronoi diagram of the points.
</p>
<p>
<a href = "../../cpp_src/triangulation_display_opengl/triangulation_display_opengl.html">
TRIANGULATION_DISPLAY_OPENGL</a>,
a C++ program which
reads files defining a triangulation and displays an image
using Open GL.
</p>
<p>
<a href = "../../cpp_src/triangulation_plot/triangulation_plot.html">
TRIANGULATION_PLOT</a>,
a C++ program which
may be used to visualize the triangulation.
</p>
<p>
<a href = "../../f_src/tripack/tripack.html">
TRIPACK</a>,
a FORTRAN90 library which
computes the Delaunay triangulation of points in the plane.
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<li>
Marc deBerg, Marc Krevald, Mark Overmars,
Otfried Schwarzkopf,<br>
Computational Geometry,<br>
Springer, 2000,<br>
ISBN: 3-540-65620-0,<br>
LC: QA448.D38.C65.
</li>
<li>
Herbert Edelsbrunner,<br>
Geometry and Topology for Mesh Generation,<br>
Cambridge, 2001,<br>
ISBN: 0-521-79309-2,<br>
LC: QA377.E36.
</li>
<li>
Barry Joe,<br>
GEOMPACK - a software package for the generation of meshes
using geometric algorithms,<br>
Advances in Engineering Software,<br>
Volume 13, pages 325-331, 1991.
</li>
<li>
Joseph ORourke,<br>
Computational Geometry,<br>
Second Edition,<br>
Cambridge, 1998,<br>
ISBN: 0521649765,<br>
LC: QA448.D38.
</li>
<li>
Per-Olof Persson, Gilbert Strang,<br>
A Simple Mesh Generator in MATLAB,<br>
SIAM Review,<br>
Volume 46, Number 2, pages 329-345, June 2004.
</li>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "table_delaunay.cpp">table_delaunay.cpp</a>, the source code.
</li>
<li>
<a href = "table_delaunay.sh">table_delaunay.sh</a>,
commands to compile, link and load the source code.
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<b>HEX_CVT3</b> puts a set of 139 nodes into the double hexagonal
hole region using CVT techniques.
<ul>
<li>
<a href = "../../data/triangulation_order3/hex_cvt3_nodes.txt">
hex_cvt3_nodes.txt</a>,
the nodes.
</li>
<li>
<a href = "../../data/triangulation_order3/hex_cvt3_nodes.png">
hex_cvt3_nodes.png</a>,
a PNG image of the nodes.
</li>
<li>
<a href = "../../data/triangulation_order3/hex_cvt3_elements.txt">
hex_cvt3_elements.txt</a>,
the triangulation created by TABLE_DELAUNAY.
</li>
<li>
<a href = "../../data/triangulation_order3/hex_cvt3_triangulation.png">
hex_cvt3_triangulation.png</a>,
a PNG image of the triangulation.
</li>
</ul>
</p>
<h3 align = "center">
List of Routines:
</h3>
<p>
<ul>
<li>
<b>MAIN</b> is the main program for TABLE_DELAUNAY.
</li>
<li>
<b>CH_CAP</b> capitalizes a single character.
</li>
<li>
<b>CH_EQI</b> is true if two characters are equal, disregarding case.
</li>
<li>
<b>CH_TO_DIGIT</b> returns the integer value of a base 10 digit.
</li>
<li>
<b>DIAEDG</b> chooses a diagonal edge.
</li>
<li>
<b>DTABLE_DATA_READ</b> reads the data from a DTABLE file.
</li>
<li>
<b>DTABLE_HEADER_READ</b> reads the header from a DTABLE file.
</li>
<li>
<b>DTRIS2</b> constructs a Delaunay triangulation of 2D vertices.
</li>
<li>
<b>FILE_COLUMN_COUNT</b> counts the number of columns in the first line of a file.
</li>
<li>
<b>FILE_ROW_COUNT</b> counts the number of row records in a file.
</li>
<li>
<b>I4_MAX</b> returns the maximum of two I4's.
</li>
<li>
<b>I4_MIN</b> returns the minimum of two I4's.
</li>
<li>
<b>I4_MODP</b> returns the nonnegative remainder of I4 division.
</li>
<li>
<b>I4_SIGN</b> returns the sign of an I4.
</li>
<li>
<b>I4_WRAP</b> forces an I4 to lie between given limits by wrapping.
</li>
<li>
<b>I4MAT_TRANSPOSE_PRINT_SOME</b> prints some of an I4MAT, transposed.
</li>
<li>
<b>ITABLE_WRITE0</b> writes an ITABLE file with no header.
</li>
<li>
<b>I4VEC_INDICATOR_NEW</b> sets an I4VEC to the indicator vector.
</li>
<li>
<b>I4VEC_SORT_HEAP_INDEX_A</b> does an indexed heap ascending sort of an I4VEC.
</li>
<li>
<b>LRLINE</b> determines where a point lies in relation to a directed line.
</li>
<li>
<b>PERM_CHECK</b> checks that a vector represents a permutation.
</li>
<li>
<b>PERM_INVERSE</b> inverts a permutation "in place".
</li>
<li>
<b>R8_ABS</b> returns the absolute value of an R8.
</li>
<li>
<b>R8_EPSILON</b> returns the R8 roundoff unit.
</li>
<li>
<b>R8_HUGE</b> returns a "huge" R8.
</li>
<li>
<b>R8_MAX</b> returns the maximum of two R8's.
</li>
<li>
<b>R8_MIN</b> returns the minimum of two R8's.
</li>
<li>
<b>R8_NINT</b> returns the nearest integer to an R8.
</li>
<li>
<b>R82VEC_PERMUTE</b> permutes an R82VEC in place.
</li>
<li>
<b>R82VEC_SORT_HEAP_INDEX_A</b> does an indexed heap ascending sort of an R82VEC.
</li>
<li>
<b>R8MAT_TRANSPOSE_PRINT_SOME</b> prints some of an R8MAT, transposed.
</li>
<li>
<b>S_LEN_TRIM</b> returns the length of a string to the last nonblank.
</li>
<li>
<b>S_TO_R8</b> reads an R8 from a string.
</li>
<li>
<b>S_TO_R8VEC</b> reads an R8VEC from a string.
</li>
<li>
<b>S_WORD_COUNT</b> counts the number of "words" in a string.
</li>
<li>
<b>SWAPEC</b> swaps diagonal edges until all triangles are Delaunay.
</li>
<li>
<b>TIMESTAMP</b> prints the current YMDHMS date as a time stamp.
</li>
<li>
<b>VBEDG</b> determines which boundary edges are visible to a point.
</li>
</ul>
</p>
<p>
You can go up one level to <a href = "../cpp_src.html">
the C++ source codes</a>.
</p>
<hr>
<i>
Last revised on 01 October 2009.
</i>
<!-- John Burkardt -->
</body>
</html>