forked from johannesgerer/jburkardt-f
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathtable_merge.html
424 lines (371 loc) · 11.8 KB
/
table_merge.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
<html>
<head>
<title>
TABLE_MERGE - Merge Duplicate or Nearby Points.
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
TABLE_MERGE <br> Merge Duplicate or Nearby Points.
</h1>
<hr>
<p>
<b>TABLE_MERGE</b>
is a FORTRAN90 program which
can be used to remove duplicate points from a file, or
to merge points that are very close.
</p>
<p>
Initially, each point is in its own cluster. If two clusters
are separated by a distance of less than the tolerance, then
they are replaced by one cluster, whose representative point
is the weighted sum of the two cluster representatives.
</p>
<p>
The clusters are repeatedly processed until all clusters are
separated by a distance of at least the tolerance.
</p>
<p>
This algorithm may be useful when a dataset containing a number
of points is given, and
<ul>
<li>
duplicate points must be removed (in this case, a value of
TOLERANCE = 0 will work)
</li>
<li>
OR, points that are very close to each other should be discarded.
In this case, a "small" value of TOLERANCE is appropriate.
</li>
</ul>
</p>
<p>
Note that this procedure depends on the ordering of the points.
If you have three points A < B < C separated by slightly
less than the tolerance, then A and B will be merged or B and C
will be merged, depending on the labels of the nodes. Thus
this process is not a strictly geometric procedure.
</p>
<p>
Secondly, it should be obvious that the procedure may return
points that were not input points, because of the use of centroids.
</p>
<p>
Third, this procedure does guarantee that the output points are
separated by more than TOLERANCE units of distance.
</p>
<h3 align = "center">
Usage:
</h3>
<p>
<dl>
<dt>
<b>table_merge</b> <i>table_file</i> <i>tolerance</i>
</dt>
<dd>
reads the points in <i>table_file</i>, removes duplicates,
replaces points that are within <i>tolerance</i> of each
other by a centroid, and writes out the revised file.
</dd>
</dl>
</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_MERGE</b> is available in
<a href = "../../f_src/table_merge/table_merge.html">a FORTRAN90 version</a> and
<a href = "../../m_src/table_merge/table_merge.html">a MATLAB version.</a>
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../f_src/point_merge/point_merge.html">
POINT_MERGE</a>,
a FORTRAN90 library which
considers N points in M dimensional space, and counts or indexes
the unique or "tolerably unique" items.
</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 = "../../f_src/table_barplot_ppma/table_barplot_ppma.html">
TABLE_BARPLOT_PPMA</a>,
a FORTRAN90 program which
reads a table file and creates an ASCII Portable Pixel Map (PPM) bargraph of the data.
</p>
<p>
<a href = "../../f_src/table_border/table_border.html">
TABLE_BORDER</a>,
a FORTRAN90 program which
adds a border (of zero values) to a table file.
</p>
<p>
<a href = "../../f_src/table_columns/table_columns.html">
TABLE_COLUMNS</a>,
a FORTRAN90 program which
extracts specific columns of data from a table file.
</p>
<p>
<a href = "../../f_src/table_columns_permute/table_columns_permute.html">
TABLE_COLUMNS_PERMUTE</a>,
a FORTRAN90 program which
permutes the columns of a table file.
</p>
<p>
<a href = "../../f_src/table_delaunay/table_delaunay.html">
TABLE_DELAUNAY</a>,
a FORTRAN90 program which
computes the Delaunay triangulation of a set of points.
</p>
<p>
<a href = "../../f_src/table_histogram/table_histogram.html">
TABLE_HISTOGRAM</a>,
a FORTRAN90 program which
makes a histogram of a set of points stored in a table file.
</p>
<p>
<a href = "../../f_src/table_io/table_io.html">
TABLE_IO</a>,
a FORTRAN90 library which
supplies the routines used to read the TABLE file.
</p>
<p>
<a href = "../../f_src/table_latinize/table_latinize.html">
TABLE_LATINIZE</a>,
a FORTRAN90 program which
reads a file of points and creates a "latinized" version by adjusting the data.
</p>
<p>
<a href = "../../f_src/table_orthonormalize/table_orthonormalize.html">
TABLE_ORTHONORMALIZE</a>,
a FORTRAN90 program which
reads a file of points and orthonormalizes the columns.
</p>
<p>
<a href = "../../f_src/table_quality/table_quality.html">
TABLE_QUALITY</a>,
a FORTRAN90 program which
reads a file of points and computes the quality of dispersion.
</p>
<p>
<a href = "../../m_src/table_read/table_read.html">
TABLE_READ</a>,
a MATLAB program which
reads a TABLE file.
</p>
<p>
<a href = "../../f_src/table_record_match/table_record_match.html">
TABLE_RECORD_MATCH</a>,
a FORTRAN90 program which
finds close records in a table file.
</p>
<p>
<a href = "../../f_src/table_scale/table_scale.html">
TABLE_SCALE</a>,
a FORTRAN90 program which
multiplies the entries of a table file by a scale vector.
</p>
<p>
<a href = "../../f_src/table_shift/table_shift.html">
TABLE_SHIFT</a>,
a FORTRAN90 program which
shifts the entries of a table file by a shift vector.
</p>
<p>
<a href = "../../f_src/table_stats/table_stats.html">
TABLE_STATS</a>,
a FORTRAN90 program which
reads a table file and compute certain statistics.
</p>
<p>
<a href = "../../f_src/table_tet_mesh/table_tet_mesh.html">
TABLE_TET_MESH</a>,
a FORTRAN90 program which
reads a table file of 3D data, and compute a tetrahedral mesh.
</p>
<p>
<a href = "../../f_src/table_top/table_top.html">
TABLE_TOP</a>,
a FORTRAN90 program which
reads a table file of M-dimensional data and
makes a table of plots of all pairs of coordinates.
</p>
<p>
<a href = "../../f_src/table_unborder/table_unborder.html">
TABLE_UNBORDER</a>,
a FORTRAN90 program which
removes the border from a table file.
</p>
<p>
<a href = "../../f_src/table_uniform_noise/table_uniform_noise.html">
TABLE_UNIFORM_NOISE</a>,
a FORTRAN90 program which
adds a uniform noise term to the data in a table file.
</p>
<p>
<a href = "../../f_src/table_voronoi/table_voronoi.html">
TABLE_VORONOI</a>,
a FORTRAN90 program which
computes information about the Voronoi diagram of the points.
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "table_merge.f90">table_merge.f90</a>, the source code.
</li>
<li>
<a href = "table_merge.sh">table_merge.sh</a>,
commands to compile the source code.
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<ul>
<li>
<a href = "uniform_02_00100.txt">uniform_02_00100.txt</a>,
100 random points in the unit square.
</li>
<li>
<a href = "uniform_02_00100.png">uniform_02_00100.png</a>,
a <a href = "../../data/png/png.html">PNG</a> image of the data.
</li>
<li>
<a href = "uniform_02_00100.0.05.txt">uniform_02_00100.0.05.txt</a>,
the points, merged with a tolerance of 0.05.
</li>
<li>
<a href = "uniform_02_00100.0.05.png">uniform_02_00100.0.05.png</a>,
a <a href = "../../data/png/png.html">PNG</a> image of the data.
</li>
<li>
<a href = "uniform_02_00100.0.10.txt">uniform_02_00100.0.10.txt</a>,
the points, merged with a tolerance of 0.10.
</li>
<li>
<a href = "uniform_02_00100.0.10.png">uniform_02_00100.0.10.png</a>,
a <a href = "../../data/png/png.html">PNG</a> image of the data.
</li>
<li>
<a href = "uniform_02_00100.0.20.txt">uniform_02_00100.0.20.txt</a>,
the points, merged with a tolerance of 0.20.
</li>
<li>
<a href = "uniform_02_00100.0.20.png">uniform_02_00100.0.20.png</a>,
a <a href = "../../data/png/png.html">PNG</a> image of the data.
</li>
</ul>
</p>
<h3 align = "center">
List of Routines:
</h3>
<p>
<ul>
<li>
<b>MAIN</b> is the main program for TABLE_MERGE.
</li>
<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>FILE_COLUMN_COUNT</b> counts the number of columns in the first line of a file.
</li>
<li>
<b>FILE_NAME_EXT_GET</b> determines the "extension" of a file name.
</li>
<li>
<b>FILE_NAME_EXT_SWAP</b> replaces the current "extension" of a file name.
</li>
<li>
<b>FILE_ROW_COUNT</b> counts the number of row records in a file.
</li>
<li>
<b>GET_UNIT</b> returns a free FORTRAN unit number.
</li>
<li>
<b>I4_SWAP</b> switches two integer values.
</li>
<li>
<b>I4VEC_HEAP_D</b> reorders an array of integers into a descending heap.
</li>
<li>
<b>I4VEC_SORT_HEAP_A</b> ascending sorts an integer array using heap sort.
</li>
<li>
<b>NODE_CLUSTER_EPSILON</b> clusters points with a tolerance.
</li>
<li>
<b>NODE_MERGE</b> detects nodes that should be merged.
</li>
<li>
<b>R8MAT_DATA_READ</b> reads data from an R8MAT file.
</li>
<li>
<b>R8MAT_HEADER_READ</b> reads the header from an R8MAT file.
</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_WRITE</b> writes an R8MAT file.
</li>
<li>
<b>S_BLANK_DELETE</b> removes blanks from a string, left justifying the remainder.
</li>
<li>
<b>S_INDEX_LAST_C</b> finds the LAST occurrence of a given character.
</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>TIMESTAMP</b> prints the current YMDHMS date as a time stamp.
</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 14 December 2011.
</i>
<!-- John Burkardt -->
</body>
<!-- Initial HTML skeleton created by HTMLINDEX. -->
</html>