forked from johannesgerer/jburkardt-f
-
Notifications
You must be signed in to change notification settings - Fork 1
/
cvt.html
489 lines (437 loc) · 13.9 KB
/
cvt.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
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
<html>
<head>
<title>
CVT - Centroidal Voronoi Tessellations
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
CVT <br> Centroidal Voronoi Tessellations
</h1>
<hr>
<p>
<b>CVT</b>
is a FORTRAN90 library which
computes Centroidal Voronoi Tessellation (CVT) datasets.
</p>
<p>
The generation of a CVT dataset is of necessity more complicated than
that of a quasirandom dataset. A quasirandom dataset is generally
simply the first N values of a deterministic sequence. But to compute
a CVT requires an iteration, so there must be an initial assignment
for the generators, and then a number of iterations. Moreover, in
each iteration, estimates must be made of the volume and location
of the Voronoi cells. This is typically done by Monte Carlo
sampling. The accuracy of the resulting CVT depends in part on
the number of sampling points and the number of iterations taken.
</p>
<p>
The library is mostly used to generate a dataset of points
uniformly distributed in the unit hypersquare. However, a user
may be interested in computations with other geometries or
point densities. To do this, the user needs to replace the
<b>USER</b> routine in the <b>CVT</b> library, and then specify
the appropriate values <b>init=3</b> and <b>sample=3</b>.
</p>
<p>
The <b>USER</b> routine returns a set of sample points from the
region of interest. The default <b>USER</b> routine samples points
uniformly from the unit circle. But other geometries are
easy to set up. Changing the point density simply requires
weighting the sampling in the region.
</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>CVT</b> is available in
<a href = "../../cpp_src/cvt/cvt.html">a C++ version</a> and
<a href = "../../f_src/cvt/cvt.html">a FORTRAN90 version</a> and
<a href = "../../m_src/cvt/cvt.html">a MATLAB version</a>.
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../datasets/cvt/cvt.html">
CVT</a>,
a dataset directory which
contains a variety of CVT datasets.
</p>
<p>
<a href = "../../f_src/cvt_basis/cvt_basis.html">
CVT_BASIS</a>,
a FORTRAN90 program which
seeks to produce a small set of basis vectors from a large set of data vectors.
</p>
<p>
<a href = "../../f_src/cvt_dataset/cvt_dataset.html">
CVT_DATASET</a>,
a FORTRAN90 program which
computes a CVT dataset.
</p>
<p>
<a href = "../../m_src/cvt_demo/cvt_demo.html">
CVT_DEMO</a>,
a MATLAB library which
demonstrates the computation of a CVT.
</p>
<p>
<a href = "../../f_src/cvt_fixed/cvt_fixed.html">
CVT_FIXED</a>,
a FORTRAN90 library which
computes CVT's in which some values
are to be fixed.
</p>
<p>
<a href = "../../f_src/cvt_mod/cvt_mod.html">
CVT_MOD</a>,
a FORTRAN90 library which
computes CVT's on a unit
square with "mod" geometry, which essentially makes the unit
square a tile in a periodic pattern.
</p>
<p>
<a href = "../../f_src/cvt_triangulation/cvt_triangulation.html">
CVT_TRIANGULATION</a>,
a FORTRAN90 program which
constructs a CVT for a region
specified by the <b>TEST_TRIANGULATION</b> library.
</p>
<p>
<a href = "../../f_src/faure/faure.html">
FAURE</a>,
a FORTRAN90 library which
computes elements of a Faure quasirandom sequence.
</p>
<p>
<a href = "../../f_src/grid/grid.html">
GRID</a>,
a FORTRAN90 library which
computes elements of a grid dataset.
</p>
<p>
<a href = "../../f_src/halton/halton.html">
HALTON</a>,
a FORTRAN90 library which
computes elements of a Halton quasirandom sequence.
</p>
<p>
<a href = "../../f_src/hammersley/hammersley.html">
HAMMERSLEY</a>,
a FORTRAN90 library which
computes elements of a Hammersley quasirandom sequence.
</p>
<p>
<a href = "../../f_src/hex_grid/hex_grid.html">
HEX_GRID</a>,
a FORTRAN90 library which
computes elements of a hexagonal grid dataset.
</p>
<p>
<a href = "../../f_src/hex_grid_angle/hex_grid_angle.html">
HEX_GRID_ANGLE</a>,
a FORTRAN90 library which
computes elements of an angled hexagonal grid dataset.
</p>
<p>
<a href = "../../f_src/ihs/ihs.html">
IHS</a>,
a FORTRAN90 library which
computes elements of an improved distributed Latin hypercube dataset.
</p>
<p>
<a href = "../../f_src/latin_center/latin_center.html">
LATIN_CENTER</a>,
a FORTRAN90 library which
computes elements of a Latin Hypercube dataset, choosing center points.
</p>
<p>
<a href = "../../f_src/latin_edge/latin_edge.html">
LATIN_EDGE</a>,
a FORTRAN90 library which
computes elements of a Latin Hypercube dataset, choosing edge points.
</p>
<p>
<a href = "../../f_src/latin_random/latin_random.html">
LATIN_RANDOM</a>,
a FORTRAN90 library which
computes elements of a Latin Hypercube dataset, choosing
points at random.
</p>
<p>
<a href = "../../f_src/lattice_rule/lattice_rule.html">
LATTICE_RULE</a>,
a FORTRAN90 library which
approximates multidimensional integrals using lattice rules.
</p>
<p>
<a href = "../../f_src/lcvt/lcvt.html">
LCVT</a>,
a FORTRAN90 library which
computes a latinized
Centroidal Voronoi Tessellation.
</p>
<p>
<a href = "../../f_src/niederreiter2/niederreiter2.html">
NIEDERREITER2</a>,
a FORTRAN90 library which
computes elements of a Niederreiter quasirandom sequence with base 2.
</p>
<p>
<a href = "../../f_src/normal/normal.html">
NORMAL</a>,
a FORTRAN90 library which
computes elements of a
sequence of pseudorandom normally distributed values.
</p>
<p>
<a href = "../../f_src/sandia_cvt/sandia_cvt.html">
SANDIA_CVT</a>,
a FORTRAN90 library which
computes CVT's.
</p>
<p>
<a href = "../../f_src/sobol/sobol.html">
SOBOL</a>,
a FORTRAN90 library which
computes elements of a Sobol quasirandom sequence.
</p>
<p>
<a href = "../../f_src/uniform/uniform.html">
UNIFORM</a>,
a FORTRAN90 library which
computes elements of a uniform pseudorandom sequence.
</p>
<p>
<a href = "../../f_src/van_der_corput/van_der_corput.html">
VAN_DER_CORPUT</a>,
a FORTRAN90 library which
computes elements of a van der Corput quasirandom sequence.
</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>
Paul Bratley, Bennett Fox, Linus Schrage,<br>
A Guide to Simulation,<br>
Springer Verlag, pages 201-202, 1983.
</li>
<li>
John Burkardt, Max Gunzburger, Janet Peterson, Rebecca Brannon,<br>
User Manual and Supporting Information for Library of Codes
for Centroidal Voronoi Placement and Associated Zeroth,
First, and Second Moment Determination,<br>
Sandia National Laboratories Technical Report SAND2002-0099,<br>
February 2002.
</li>
<li>
Qiang Du, Vance Faber, Max Gunzburger,<br>
Centroidal Voronoi Tessellations: Applications and Algorithms,<br>
SIAM Review,<br>
Volume 41, 1999, pages 637-676.
</li>
<li>
Bennett Fox,<br>
Algorithm 647:<br>
Implementation and Relative Efficiency of Quasirandom
Sequence Generators,<br>
ACM Transactions on Mathematical Software,<br>
Volume 12, Number 4, pages 362-376, 1986.
</li>
<li>
John Halton,<br>
On the efficiency of certain quasi-random sequences of points
in evaluating multi-dimensional integrals,<br>
Numerische Mathematik,<br>
Volume 2, pages 84-90, 1960.
</li>
<li>
Lili Ju, Qiang Du, Max Gunzburger,<br>
Probabilistic methods for centroidal Voronoi tessellations
and their parallel implementations,<br>
Parallel Computing,<br>
Volume 28, 2002, pages 1477-1500.
</li>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "cvt.f90">cvt.f90</a>, the source code;
</li>
<li>
<a href = "cvt.sh">cvt.sh</a>,
commands to compile the source code;
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<ul>
<li>
<a href = "cvt_prb.f90">cvt_prb.f90</a>,
a sample calling program.
</li>
<li>
<a href = "cvt_prb.sh">cvt_prb.sh</a>,
commands to compile and run the sample program.
</li>
<li>
<a href = "cvt_prb_output.txt">cvt_prb_output.txt</a>,
the output file.
</li>
<li>
<a href = "cvt_circle.txt">cvt_circle.txt</a>,
a set of 100 CVT points in a circle, generated using
the built in <b>USER</b> routine.
</li>
<li>
<a href = "cvt_circle.png">cvt_circle.png</a>,
a <a href = "../../data/png/png.html">PNG</a>
image of the 100 CVT points in a circle.
</li>
</ul>
</p>
<h3 align = "center">
List of Routines:
</h3>
<p>
<ul>
<li>
<b>CH_CAP</b> capitalizes a single character.
</li>
<li>
<b>CH_EQI</b> is a case insensitive comparison of two characters for equality.
</li>
<li>
<b>CH_TO_DIGIT</b> returns the integer value of a base 10 digit.
</li>
<li>
<b>CVT</b> computes a Centroidal Voronoi Tessellation.
</li>
<li>
<b>CVT_ENERGY</b> computes the CVT energy of a dataset.
</li>
<li>
<b>CVT_ITERATE</b> takes one step of the CVT iteration.
</li>
<li>
<b>CVT_SAMPLE</b> returns sample points.
</li>
<li>
<b>CVT_WRITE</b> writes a CVT dataset to a file.
</li>
<li>
<b>DATA_READ</b> reads generator coordinate data from a file.
</li>
<li>
<b>FIND_CLOSEST</b> finds the nearest R point to each S point.
</li>
<li>
<b>GET_SEED</b> returns a seed for the random number generator.
</li>
<li>
<b>GET_UNIT</b> returns a free FORTRAN unit number.
</li>
<li>
<b>HALHAM_LEAP_CHECK</b> checks LEAP for a Halton or Hammersley sequence.
</li>
<li>
<b>HALHAM_N_CHECK</b> checks N for a Halton or Hammersley sequence.
</li>
<li>
<b>HALHAM_DIM_NUM_CHECK</b> checks DIM_NUM for a Halton or Hammersley sequence.
</li>
<li>
<b>HALHAM_SEED_CHECK</b> checks SEED for a Halton or Hammersley sequence.
</li>
<li>
<b>HALHAM_STEP_CHECK</b> checks STEP for a Halton or Hammersley sequence.
</li>
<li>
<b>HALTON_BASE_CHECK</b> checks BASE for a Halton sequence.
</li>
<li>
<b>I4_TO_HALTON_SEQUENCE</b> computes N elements of a leaped Halton subsequence.
</li>
<li>
<b>I4VEC_TRANSPOSE_PRINT</b> prints an integer vector "transposed".
</li>
<li>
<b>PRIME</b> returns any of the first PRIME_MAX prime numbers.
</li>
<li>
<b>R8MAT_TRANSPOSE_PRINT</b> prints a real matrix, transposed.
</li>
<li>
<b>R8MAT_TRANSPOSE_PRINT_SOME</b> prints some of a real matrix, transposed.
</li>
<li>
<b>R8MAT_UNIFORM_01</b> fills an array with pseudorandom numbers.
</li>
<li>
<b>RANDOM_INITIALIZE</b> initializes the FORTRAN90 random number seed.
</li>
<li>
<b>S_CAP</b> replaces any lowercase letters by uppercase ones in a string.
</li>
<li>
<b>S_EQI</b> is a case insensitive comparison of two strings for equality.
</li>
<li>
<b>S_TO_I4</b> reads an integer value from a string.
</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>TIMESTAMP</b> prints the current YMDHMS date as a time stamp.
</li>
<li>
<b>TIMESTRING</b> writes the current YMDHMS date into a string.
</li>
<li>
<b>TUPLE_NEXT_FAST</b> computes the next element of a tuple space, "fast".
</li>
<li>
<b>USER</b> samples points in a user-specified region with given density.
</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 12 November 2006.
</i>
<!-- John Burkardt -->
</body>
</html>