forked from johannesgerer/jburkardt-cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtet_mesh.html
604 lines (553 loc) · 17.3 KB
/
tet_mesh.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
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
<html>
<head>
<title>
TET_MESH - Routines for a Tet Mesh
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
TET_MESH <br> Routines for a Tet Mesh
</h1>
<hr>
<p>
<b>TET_MESH</b>
is a C++ library which
constructs, describes, or modifies a mesh of tetrahedrons.
</p>
<h3 align = "center">
Linear and Quadratic Meshes
</h3>
<p>
The simplest tet mesh, which we term an <i>order 4</i>
or <i>linear</i> mesh, uses four points to define each tetrahedron.
A second type of mesh, known as an <i>order 10</i> or <i>quadratic</i>
mesh, uses ten points.
</p>
<p>
While an order 4 mesh can naturally be constructed directly from
most sets of data points, a mesh of order 10 is not usually
constructed directly from the data; at least in the simplest case,
one wants the 6 extra nodes to be the midpoints of the sides
determined by the 4 vertices.
</p>
<p>
Thus, an order 10 tet mesh is typically generated in two steps:
<ul>
<li>
generate an order 4 mesh, in which every tetrahedral vertex
comes from a user data point;
</li>
<li>
generate an order 10 mesh from the order 4 mesh, in which
the new midside points are not user data points, but rather
<i>averages</i> of pairs of tetrahedral vertices.
</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>TET_MESH</b> is available in
<a href = "../../c_src/tet_mesh/tet_mesh.html">a C++ version</a> and
<a href = "../../cpp_src/tet_mesh/tet_mesh.html">a C++ version</a> and
<a href = "../../f77_src/tet_mesh/tet_mesh.html">a FORTRAN77 version</a> and
<a href = "../../f_src/tet_mesh/tet_mesh.html">a FORTRAN90 version</a> and
<a href = "../../m_src/tet_mesh/tet_mesh.html">a MATLAB version</a>.
</p>
<h3 align = "center">
Related Programs:
</h3>
<p>
<a href = "../../f_src/cvt_tet_mesh/cvt_tet_mesh.html">
CVT_TET_MESH</a>,
a FORTRAN90 library which
uses CVT methods to compute a tet mesh in a region.
</p>
<p>
<a href = "../../cpp_src/geometry/geometry.html">
GEOMETRY</a>,
a C++ library which
includes a number of routines for
making computations involving tetrahedrons.
</p>
<p>
<a href = "../../cpp_src/geompack/geompack.html">
GEOMPACK</a>,
a C++ library which
contains a routine
<b>DTRIS3</b> that can compute the tet mesh for a set of 3D points,
as well as the adjacency information.
</p>
<p>
<a href = "../../cpp_src/keast/keast.html">
KEAST</a>,
a C++ library which
defines a number of quadrature rules
for a tetrahedron.
</p>
<p>
<a href = "../../cpp_src/ncc_tetrahedron/ncc_tetrahedron.html">
NCC_TETRAHEDRON</a>,
a C++ library which
defines Newton-Cotes closed quadrature
rules on a tetrahedron.
</p>
<p>
<a href = "../../cpp_src/nco_tetrahedron/nco_tetrahedron.html">
NCO_TETRAHEDRON</a>,
a C++ library which
defines Newton-Cotes open quadrature
rules on a tetrahedron.
</p>
<p>
<a href = "../../datasets/quadrature_rules_tet/quadrature_rules_tet.html">
QUADRATURE_RULES_TET</a>,
a dataset directory which
contains triples of files defining various quadrature
rules on tetrahedrons.
</p>
<p>
<a href = "../../f_src/table_tet_mesh/table_tet_mesh.html">
TABLE_TET_MESH</a>,
a FORTRAN90 program which
can compute the tet mesh for a given set of points.
</p>
<p>
<a href = "../../f_src/test_tet_mesh/test_tet_mesh.html">
TEST_TET_MESH</a>,
a FORTRAN90 library which
defines a few test regions for the generation
of a tet mesh.
</p>
<p>
<a href = "../../cpp_src/tet_mesh_boundary/tet_mesh_boundary.html">
TET_MESH_BOUNDARY</a>,
a C++ program which
returns the nodes and faces of the boundary of a tetrahedral mesh,
which themselves form a 3D triangular mesh or "TRI_SURFACE".
</p>
<p>
<a href = "../../m_src/tet_mesh_display/tet_mesh_display.html">
TET_MESH_DISPLAY</a>,
a MATLAB program which
can read in the
node and tetra files defining a tet mesh and display a wireframe
image.
</p>
<p>
<a href = "../../cpp_src/tet_mesh_display_opengl/tet_mesh_display_opengl.html">
TET_MESH_DISPLAY_OPENGL</a>,
a C++ program which
can read in the
node and tetra files defining a tet mesh and display a wireframe
image.
</p>
<p>
<a href = "../../cpp_src/tet_mesh_l2q/tet_mesh_l2q.html">
TET_MESH_L2Q</a>,
a C++ program which
converts a linear to quadratic
tet mesh.
</p>
<p>
<a href = "../../data/tet_mesh_order4/tet_mesh_order4.html">
TET_MESH_ORDER4</a>,
a directory which
contains a description and
examples of a tet mesh using order 4 elements.
</p>
<p>
<a href = "../../data/tet_mesh_order10/tet_mesh_order10.html">
TET_MESH_ORDER10</a>,
a directory which
contains a description and
examples of a tet mesh using order 10 elements.
</p>
<p>
<a href = "../../cpp_src/tet_mesh_q2l/tet_mesh_q2l.html">
TET_MESH_Q2L</a>,
a C++ program which
converts a quadratic to linear tet mesh.
</p>
<p>
<a href = "../../cpp_src/tet_mesh_quad/tet_mesh_quad.html">
TET_MESH_QUAD</a>,
a C++ program which
estimates the integral of a function over a region defined by a tetrahedral mesh.
</p>
<p>
<a href = "../../cpp_src/tet_mesh_quality/tet_mesh_quality.html">
TET_MESH_QUALITY</a>,
a C++ program which
computes the quality of a tet mesh.
</p>
<p>
<a href = "../../cpp_src/tet_mesh_rcm/tet_mesh_rcm.html">
TET_MESH_RCM</a>,
a C++ program which
takes a tet mesh and
relabels the nodes to reduce the bandwidth of the
corresponding adjacency matrix.
</p>
<p>
<a href = "../../cpp_src/tet_mesh_refine/tet_mesh_refine.html">
TET_MESH_REFINE</a>,
a C++ program which
can refine a tet mesh.
</p>
<p>
<a href = "../../cpp_src/tet_mesh_tet_neighbors/tet_mesh_tet_neighbors.html">
TET_MESH_TET_NEIGHBORS</a>,
a C++ program which
computes the tetrahedral adjacency information.
</p>
<p>
<a href = "../../cpp_src/tet_mesh_volumes/tet_mesh_volumes.html">
TET_MESH_VOLUMES</a>,
a C++ program which
computes the volume of each tetrahedron in a tet mesh;
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<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, Number 5, 1991, pages 325-331.
</li>
<li>
Anwei Liu, Barry Joe,<br>
Quality Local Refinement of Tetrahedral Meshes Based
on 8-Subtetrahedron Subdivision,<br>
Mathematics of Computation,<br>
Volume 65, Number 215, July 1996, pages 1183-1200.
</li>
<li>
Per-Olof Persson, Gilbert Strang,<br>
A Simple Mesh Generator in MATLAB,<br>
SIAM Review,<br>
Volume 46, Number 2, June 2004, pages 329-345.
</li>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "tet_mesh.cpp">tet_mesh.cpp</a>, the source code.
</li>
<li>
<a href = "tet_mesh.hpp">tet_mesh.hpp</a>, the include file.
</li>
<li>
<a href = "tet_mesh.sh">tet_mesh.sh</a>,
commands to compile the source code.
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<ul>
<li>
<a href = "tet_mesh_prb.cpp">tet_mesh_prb.cpp</a>,
a sample calling program.
</li>
<li>
<a href = "tet_mesh_prb.sh">tet_mesh_prb.sh</a>,
commands to compile and run the sample program.
</li>
<li>
<a href = "tet_mesh_prb_output.txt">tet_mesh_prb_output.txt</a>,
the output file.
</li>
</ul>
</p>
<h3 align = "center">
List of Routines:
</h3>
<p>
<ul>
<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_SWAP</b> switches two I4's.
</li>
<li>
<b>I4_UNIFORM</b> returns a scaled pseudorandom I4.
</li>
<li>
<b>I4COL_COMPARE</b> compares columns I and J of an I4COL.
</li>
<li>
<b>I4COL_SORT_A</b> ascending sorts the columns of an I4COL.
</li>
<li>
<b>I4COL_SORT2_A</b> ascending sorts the elements of each column of an I4COL.
</li>
<li>
<b>I4COL_SORTED_UNIQUE_COUNT</b> counts unique elements in an I4COL.
</li>
<li>
<b>I4COL_SWAP</b> swaps two columns of an I4COL.
</li>
<li>
<b>I4I4_SORT_A</b> ascending sorts a pair of I4's.
</li>
<li>
<b>I4I4I4_SORT_A</b> ascending sorts a triple of I4's.
</li>
<li>
<b>I4MAT_TRANSPOSE_PRINT</b> prints an I4MAT, transposed.
</li>
<li>
<b>I4MAT_TRANSPOSE_PRINT_SOME</b> prints some of an I4MAT, transposed.
</li>
<li>
<b>I4VEC_PRINT</b> prints an I4VEC.
</li>
<li>
<b>I4VEC_SUM</b> sums the entries of an I4VEC.
</li>
<li>
<b>I4VEC_ZERO</b> zeroes an I4VEC.
</li>
<li>
<b>R4_ABS</b> returns the absolute value of an R4.
</li>
<li>
<b>R4_NINT</b> returns the nearest integer to an R4.
</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_SWAP</b> switches two R8's.
</li>
<li>
<b>R8_UNIFORM_01</b> returns a unit pseudorandom R8.
</li>
<li>
<b>R8MAT_DET_4D</b> computes the determinant of a 4 by 4 R8MAT.
</li>
<li>
<b>R8MAT_MV</b> multiplies a matrix times a vector.
</li>
<li>
<b>R8MAT_PRINT</b> prints an R8MAT, with an optional title.
</li>
<li>
<b>R8MAT_PRINT_SOME</b> prints some of an R8MAT.
</li>
<li>
<b>R8MAT_SOLVE</b> uses Gauss-Jordan elimination to solve an N by N linear system.
</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> fills a double precision array with unit pseudorandom values.
</li>
<li>
<b>R8VEC_CROSS_3D</b> computes the cross product of two vectors in 3D.
</li>
<li>
<b>R8VEC_IS_NONNEGATIVE</b> is true if all entries in an R8VEC are nonnegative.
</li>
<li>
<b>R8VEC_IS_ZERO</b> is true if the entries in an R8VEC are all zero.
</li>
<li>
<b>R8VEC_LENGTH</b> returns the Euclidean length of a R8VEC
</li>
<li>
<b>R8VEC_MAX</b> returns the maximum element in an R8VEC.
</li>
<li>
<b>R8VEC_MEAN</b> returns the mean of a R8VEC.
</li>
<li>
<b>R8VEC_MIN</b> returns the minimum element in an R8VEC.
</li>
<li>
<b>R8VEC_PRINT</b> prints an R8VEC.
</li>
<li>
<b>R8VEC_SUM</b> returns the sum of an R8VEC.
</li>
<li>
<b>R8VEC_UNIFORM_01</b> returns a unit pseudorandom R8VEC.
</li>
<li>
<b>R8VEC_VARIANCE</b> returns the variance of a double vector.
</li>
<li>
<b>R8VEC_ZERO</b> zeroes a real vector.
</li>
<li>
<b>S_LEN_TRIM</b> returns the length of a string to the last nonblank.
</li>
<li>
<b>SORT_HEAP_EXTERNAL</b> externally sorts a list of items into ascending order.
</li>
<li>
<b>TET_MESH_NEIGHBOR_TETS</b> determines tetrahedron neighbors.
</li>
<li>
<b>TET_MESH_NODE_ORDER:</b> determines the order of nodes.
</li>
<li>
<b>TET_MESH_ORDER4_ADJ_COUNT</b> counts the number of nodal adjacencies.
</li>
<li>
<b>TET_MESH_ORDER4_BOUNDARY_FACE_COUNT</b> counts the number of boundary faces.
</li>
<li>
<b>TET_MESH_ORDER4_EDGE_COUNT</b> counts the number of edges.
</li>
<li>
<b>TET_MESH_ORDER4_EXAMPLE_SET</b> sets an example linear tet mesh.
</li>
<li>
<b>TET_MESH_ORDER4_EXAMPLE_SIZE</b> sizes an example linear tet mesh.
</li>
<li>
<b>TET_MESH_ORDER4_REFINE_COMPUTE</b> computes a refined order 4 tet mesh
</li>
<li>
<b>TET_MESH_ORDER4_REFINE_SIZE</b> sizes a refined order 4 tet mesh.
</li>
<li>
<b>TET_MESH_ORDER4_TO_ORDER10_COMPUTE</b> computes a quadratic tet mesh from a linear one.
</li>
<li>
<b>TET_MESH_ORDER4_TO_ORDER10_SIZE</b> sizes a quadratic tet mesh from a linear one.
</li>
<li>
<b>TET_MESH_ORDER10_EXAMPLE_SET</b> sets an example quadratic tet mesh.
</li>
<li>
<b>TET_MESH_ORDER10_EXAMPLE_SIZE</b> sizes an example quadratic tet mesh.
</li>
<li>
<b>TET_MESH_ORDER10_TO_ORDER4_COMPUTE</b> linearizes a quadratic tet mesh.
</li>
<li>
<b>TET_MESH_ORDER10_TO_ORDER4_SIZE</b> sizes a linear tet mesh from a quadratic one.
</li>
<li>
<b>TET_MESH_QUAD</b> approximates an integral over a tet mesh.
</li>
<li>
<b>TET_MESH_QUALITY1</b> returns a tet mesh quality factor.
</li>
<li>
<b>TET_MESH_QUALITY2</b> returns a tet mesh quality factor.
</li>
<li>
<b>TET_MESH_QUALITY3</b> returns a tet mesh quality factor.
</li>
<li>
<b>TET_MESH_QUALITY4</b> returns a tet mesh quality factor.
</li>
<li>
<b>TET_MESH_QUALITY5</b> returns a tet mesh quality factor.
</li>
<li>
<b>TET_MESH_SEARCH_DELAUNAY</b> searches a Delaunay tet mesh for a point.
</li>
<li>
<b>TET_MESH_SEARCH_NAIVE</b> naively searches a tet mesh.
</li>
<li>
<b>TETRAHEDRON_BARYCENTRIC</b> returns the barycentric coordinates of a point.
</li>
<li>
<b>TETRAHEDRON_CIRCUMSPHERE_3D</b> computes the circumsphere of a tetrahedron in 3D.
</li>
<li>
<b>TETRAHEDRON_EDGE_LENGTH_3D</b> returns edge lengths of a tetrahedron in 3D.
</li>
<li>
<b>TETRAHEDRON_INSPHERE_3D</b> finds the insphere of a tetrahedron in 3D.
</li>
<li>
<b>TETRAHEDRON_ORDER4_PHYSICAL_TO_REFERENCE</b> maps physical points to reference points.
</li>
<li>
<b>TETRAHEDRON_ORDER4_REFERENCE_TO_PHYSICAL</b> maps reference points to physical points.
</li>
<li>
<b>TETRAHEDRON_QUALITY1_3D:</b> "quality" of a tetrahedron in 3D.
</li>
<li>
<b>TETRAHEDRON_QUALITY2_3D:</b> "quality" of a tetrahedron in 3D.
</li>
<li>
<b>TETRAHEDRON_QUALITY3_3D</b> computes the mean ratio of a tetrahedron.
</li>
<li>
<b>TETRAHEDRON_QUALITY4_3D</b> computes the minimum solid angle of a tetrahedron.
</li>
<li>
<b>TETRAHEDRON_REFERENCE_SAMPLE</b> samples points in the reference tetrahedron.
</li>
<li>
<b>TETRAHEDRON_SAMPLE</b> returns random points in a tetrahedron.
</li>
<li>
<b>TETRAHEDRON_VOLUME_3D</b> computes the volume of a tetrahedron in 3D.
</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 = "../cpp_src.html">
the C++ source codes</a>.
</p>
<hr>
<i>
Last revised on 20 August 2009.
</i>
<!-- John Burkardt -->
</body>
<!-- Initial HTML skeleton created by HTMLINDEX. -->
</html>