/
geompack.html
338 lines (301 loc) · 9.19 KB
/
geompack.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
<html>
<head>
<title>
GEOMPACK - Delaunay triangulation
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
GEOMPACK <br> Delaunay triangulation
</h1>
<hr>
<p>
<b>GEOMPACK</b>
is a FORTRAN90 library which
computes the Delaunay triangulation of a set of points in the plane,
by Barry Joe.
</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>GEOMPACK</b> is available in
<a href = "../../c_src/geompack/geompack.html">a C version</a> and
<a href = "../../cpp_src/geompack/geompack.html">a C++ version</a> and
<a href = "../../f77_src/geompack/geompack.html">a FORTRAN77 version</a> and
<a href = "../../f_src/geompack/geompack.html">a FORTRAN90 version</a> and
<a href = "../../m_src/geompack/geompack.html">a MATLAB version</a>.
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../cpp_src/delaunay_tree_2d/delaunay_tree_2d.html">
DELAUNAY_TREE_2D</a>,
a C++ program which
computes the Delaunay triangulation of a 2D dataset;
</p>
<p>
<a href = "../../f_src/dutch/dutch.html">
DUTCH</a>,
a FORTRAN90 library which
carries out tasks in computational geometry.
</p>
<p>
<a href = "../../f_src/geometry/geometry.html">
GEOMETRY</a>,
a FORTRAN90 library which
performs geometric calculations in 2, 3 and N dimensional space.
</p>
<p>
<a href = "../../f_src/geompack2/geompack2.html">
GEOMPACK2</a>,
a more extensive FORTRAN90 library,
from which <b>GEOMPACK</b> was extracted.
</p>
<p>
<a href = "../../f_src/geompack3/geompack3.html">
GEOMPACK3</a>,
a FORTRAN90 library which
handles 3D geometric problems.
</p>
<p>
<a href = "../../c_src/sweep2/sweep2.html">
SWEEP2</a>,
a C program which
computes Voronoi Diagrams or Delaunay triangulations,
by Steve Fortune;
</p>
<p>
<a href = "../../f_src/sphere_delaunay/sphere_delaunay.html">
SPHERE_DELAUNAY</a>,
a FORTRAN90 program which
computes and plots the Delaunay triangulation of points on the unit sphere.
</p>
<p>
<a href = "../../f_src/table_delaunay/table_delaunay.html">
TABLE_DELAUNAY</a>,
a FORTRAN90 program which
reads a file of point coordinates in the TABLE format and writes out
the Delaunay triangulation.
</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 OpenGL.
</p>
<p>
<a href = "../../f_src/triangulation_triangle_neighbors/triangulation_triangle_neighbors.html">
TRIANGULATION_TRIANGLE_NEIGHBORS</a>,
a FORTRAN90 program which
reads data defining a triangulation, determines the neighboring
triangles of each triangle, and writes that information to a file.
</p>
<h3 align = "center">
Author:
</h3>
<p>
Original FORTRAN77 version by Barry Joe;
FORTRAN90 version by John Burkardt.
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<li>
Franz Aurenhammer,<br>
Voronoi diagrams -
a study of a fundamental geometric data structure,<br>
ACM Computing Surveys,<br>
Volume 23, Number 3, pages 345-405, September 1991.
</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>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "geompack.f90">geompack.f90</a>, the source code.
</li>
<li>
<a href = "geompack.sh">geompack.sh</a>,
commands to compile the source code.
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<ul>
<li>
<a href = "geompack_prb.f90">geompack_prb.f90</a>,
a sample calling program.
</li>
<li>
<a href = "geompack_prb.sh">geompack_prb.sh</a>,
commands to compile and run the sample program.
</li>
<li>
<a href = "geompack_prb_output.txt">geompack_prb_output.txt</a>,
the output file.
</li>
<li>
<a href = "triangulation_plot.png">triangulation_plot.png</a>,
a PNG image of
a triangulation.
</li>
</ul>
</p>
<h3 align = "center">
List of Routines:
</h3>
<p>
<ul>
<li>
<b>ALPHA_MEASURE</b> determines the triangulated pointset quality measure ALPHA.
</li>
<li>
<b>ANGLE_RAD_2D</b> returns the angle swept out between two rays in 2D.
</li>
<li>
<b>ARC_COSINE</b> computes the arc cosine function, with argument truncation.
</li>
<li>
<b>DIAEDG</b> chooses a diagonal edge.
</li>
<li>
<b>DTRIS2</b> constructs a Delaunay triangulation of 2D vertices.
</li>
<li>
<b>GET_UNIT</b> returns a free FORTRAN unit number.
</li>
<li>
<b>I4_MODP</b> returns the nonnegative remainder of integer ( kind = 4 ) division.
</li>
<li>
<b>I4_SWAP</b> swaps two I4's.
</li>
<li>
<b>I4_WRAP</b> forces an I4 to lie between given limits by wrapping.
</li>
<li>
<b>I4MAT_TRANSPOSE_PRINT</b> prints an I4MAT, transposed.
</li>
<li>
<b>I4MAT_TRANSPOSE_PRINT_SOME</b> prints some of the transpose of an I4MAT.
</li>
<li>
<b>I4VEC_HEAP_D</b> reorders an I4VEC into an descending heap.
</li>
<li>
<b>I4VEC_SORT_HEAP_A</b> ascending sorts an I4VEC using heap sort.
</li>
<li>
<b>I4VEC_SORTED_UNIQUE</b> finds the unique elements in a sorted I4VEC.
</li>
<li>
<b>LRLINE</b> determines if a point is left of, right or, or on a directed line.
</li>
<li>
<b>PERM_CHECK</b> checks that a vector represents a permutation.
</li>
<li>
<b>PERM_INV</b> inverts a permutation "in place".
</li>
<li>
<b>POINTS_DELAUNAY_NAIVE_2D</b> is a naive Delaunay triangulation scheme.
</li>
<li>
<b>POINTS_HULL_2D</b> computes the convex hull of a set of points in 2D.
</li>
<li>
<b>QUAD_CONVEX_RANDOM</b> returns a random convex quadrilateral.
</li>
<li>
<b>R82VEC_PART_QUICK_A</b> reorders an R82VEC as part of a quick sort.
</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>R82VEC_SORT_QUICK_A</b> ascending sorts an R82VEC using quick sort.
</li>
<li>
<b>R8MAT_TRANSPOSE_PRINT</b> prints an R8MAT, transposed.
</li>
<li>
<b>R8MAT_TRANSPOSE_PRINT_SOME</b> prints some of an R8MAT, transposed.
</li>
<li>
<b>R8MAT_UNIFORM_01</b> returns a unit pseudorandom R8MAT.
</li>
<li>
<b>R8VEC_EQ</b> is true if two R8VEC's are equal.
</li>
<li>
<b>R8VEC_GT</b> == ( A1 > A2 ) for R8VEC's.
</li>
<li>
<b>R8VEC_LT</b> == ( A1 < A2 ) for R8VEC's.
</li>
<li>
<b>R8VEC_PRINT</b> prints an R8VEC.
</li>
<li>
<b>R8VEC_SWAP</b> swaps the entries of two R8VEC's.
</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>TRIANGLE_CIRCUMCENTER_2D</b> computes the circumcenter of a triangle in 2D.
</li>
<li>
<b>TRIANGULATION_ORDER3_PLOT</b> plots a 3-node triangulation of a set of nodes.
</li>
<li>
<b>TRIANGULATION_ORDER3_PRINT</b> prints information about a Delaunay triangulation.
</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 = "../f_src.html">
the FORTRAN90 source codes</a>.
</p>
<hr>
<i>
Last revised on 25 June 2009.
</i>
<!-- John Burkardt -->
</body>
<!-- Initial HTML skeleton created by HTMLINDEX. -->
</html>