-
Notifications
You must be signed in to change notification settings - Fork 56
/
test_triangulation.html
1921 lines (1885 loc) · 61.8 KB
/
test_triangulation.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
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<html>
<head>
<title>
TEST_TRIANGULATION - Mesh Generation Test Regions
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
TEST_TRIANGULATION <br> Mesh Generation Test Regions
</h1>
<hr>
<p>
<b>TEST_TRIANGULATION</b>
is a MATLAB library which
sets up a number of triangulation test problems.
</p>
<p>
As far as possible, a uniform and abstract approach has been used.
For each test region, a number of routines are provided, via which
it is possible for the user to determine many things about the region.
Often, just one or two routines would be needed for a particular
purpose. The names of the routines, and their purposes are:
<ul>
<li>
<b>BOUNDARY_NEAREST:</b> returns the nearest point on the boundary
of the region to a given point or set of points;
</li>
<li>
<b>BOUNDARY_PROJECT:</b> replaces an exterior point by the
nearest point on the boundary;
</li>
<li>
<b>BOUNDARY_SEGMENT:</b> returns a sequence of roughly equally spaced
points that lie on one particular boundary segment;
</li>
<li>
<b>BOUNDARY_SEGMENT_LENGTH:</b> returns the "length" (number of
nodes) of a particular boundary segment. This simply counts
the number of points needed to trace or approximate the
boundary segment;
</li>
<li>
<b>BOUNDARY_SEGMENT_NUM:</b> returns the number of boundary segments.
Simple regions have one boundary segment. A region with one hole
has two, and so on;
</li>
<li>
<b>BOX:</b> returns a bounding box for the region. All points in
the region are within this box;
</li>
<li>
<b>DENSITY:</b> the value of the mesh density function at any
point in the region. If this is not constant, then high values
correspond to places where many more mesh points should be placed;
</li>
<li>
<b>ELEMENT_SIZE:</b> returns a requested typical element size. This
refers to the average size of the triangles formed by a triangulation
of the points;
</li>
<li>
<b>FIXED_NUM:</b> returns the number of points which must be
included as nodes of the mesh (which may be zero);
</li>
<li>
<b>FIXED_POINTS:</b> returns the coordinates of the points which
must be included as nodes of the mesh;
</li>
<li>
<b>HEADER:</b> prints a brief description of the problem;
</li>
<li>
<b>HOLE_NUM:</b> returns the number of "holes" in the region;
</li>
<li>
<b>HOLE_POINT:</b> returns the coordinates of one point in a hole
(useful when TRIANGLE is to be invoked);
</li>
<li>
<b>INSIDE:</b> reports which of a given set of points are
inside the regioin.
</li>
<li>
<b>SAMPLE:</b> returns a set of sample points from the region,
chosen with uniform probability;
</li>
<li>
<b>SAMPLE_H1:</b> returns a set of sample points from the region
after it has been enlarged by an amount H1;
</li>
<li>
<b>SDIST:</b> returns the signed distance to the boundary of
the region for each of a set of input points.
(a positive distance means the point is outside the region,
a negative distance means it is inside);
<i>(Not ready for problems 4, 5, 6, 7, 8, 9 )</i>
</li>
<li>
<b>TITLE:</b> a title for the problem;
</li>
</ul>
</p>
<p>
The test problems include:
<ol>
<li>
The unit circle;
</li>
<li>
The unit circle with a circular hole;
</li>
<li>
A square with a circular hole;
</li>
<li>
A hexagon with a hexagonal hole;
</li>
<li>
The horn;
</li>
<li>
The superellipse with a superelliptical hole;
</li>
<li>
The bicycle seat;
</li>
<li>
The slice of pie with a circular hole and triangular notch;
</li>
<li>
Jeff Borggaard's square with two hexagonal holes;
</li>
<li>
The unit square;
</li>
<li>
The L-shaped region;
</li>
<li>
John Shadid's H-shaped region;
</li>
<li>
The Sandia fork;
</li>
<li>
Marcus Garvie's Lake Alpha, with Beta Island;
</li>
<li>
Sangbum Kim's forward step;
</li>
</ol>
</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>TEST_TRIANGULATION</b> is available in
<a href = "../../f_src/test_triangulation/test_triangulation.html">a FORTRAN90 version</a> and
<a href = "../../m_src/test_triangulation/test_triangulation.html">a MATLAB version</a>.
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../f_src/cvt_triangulation/cvt_triangulation.html">
CVT_TRIANGULATION</a>,
a FORTRAN90 program which
uses this library
of test regions and attempts to create a CVT-based triangularization.
</p>
<p>
<a href = "../../m_src/distmesh/distmesh.html">
DISTMESH</a>,
a MATLAB program which
can work from a simple description
of the boundary of a region to produce a triangulation of that region.
</p>
<p>
<a href = "../../f_src/hex_grid_triangulate/hex_grid_triangulate.html">
HEX_GRID_TRIANGULATE</a>,
a FORTRAN90 program which
uses this library of test regions and computes points on a hexagonal grid
inside each region.
</p>
<p>
<a href = "../../m_src/mesh2d/mesh2d.html">
MESH2D</a>,
a MATLAB library which
can automatically create a triangular mesh for a given polygonal region,
by Darren Engwirda.
</p>
<p>
<a href = "../../m_src/triangulation/triangulation.html">
TRIANGULATION</a>,
a MATLAB library which
carries out various operations on order 3 ("linear") or order 6
("quadratic") triangulations.
</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 = "../../data/triangulation_order3/triangulation_order3.html">
TRIANGULATION_ORDER3</a>,
a data directory which
describes the format for
triangulations of order 3.
</p>
<p>
<a href = "../../data/triangulation_order6/triangulation_order6.html">
TRIANGULATION_ORDER6</a>,
a data directory which
describes the format for
triangulations of order 6.
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<li>
Per-Olof Persson and 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 = "angle_contains_point_2d.m">
angle_contains_point_2d.m</a>,
determines whether an angle contains a point.
</li>
<li>
<a href = "angle_half_2d.m">
angle_half_2d.m</a>,
divides an angle in half.
</li>
<li>
<a href = "angle_rad_2d.m">
angle_rad_2d.m</a>,
determines the angle swept out between two rays.
</li>
<li>
<a href = "atan4.m">atan4.m</a>,
computes the inverse tangent of the ratio Y / X.
</li>
<li>
<a href = "box_contains_point_2d.m">
box_contains_point_2d.m</a>,
determines if a box contains a point in 2D.
</li>
<li>
<a href = "circle_arc_point_near_2d.m">
circle_arc_point_near_2d.m</a>,
nearest point on a circular arc in 2D.
</li>
<li>
<a href = "circle_imp_contains_point_2d.m">
circle_imp_contains_point_2d.m</a>,
determines if a circle contains a point in 2D.
</li>
<li>
<a href = "circle_imp_point_near_2d.m">
circle_imp_point_near_2d.m</a>,
nearest point on a circle in 2D.
</li>
<li>
<a href = "circle_sector_contains_point_2d.m">
circle_sector_contains_point_2d.m</a>,
determines if a circle sector contains a point in 2D.
</li>
<li>
<a href = "cos_deg.m">cos_deg.m</a>,
returns the cosine of an angle given in degrees.
</li>
<li>
<a href = "file_name_inc.m">
file_name_inc.m</a>,
generates the next filename in a series.
</li>
<li>
<a href = "fmin_rc.m">
fmin_rc.m</a>,
seeks the minimum of a scalar function of a scalar argument.
</li>
<li>
<a href = "hex_grid_angle.m">
hex_grid_angle.m</a>,
sets the points in an angled hex grid in a box.
</li>
<li>
<a href = "hex_grid_angle_size.m">
hex_grid_angle_size.m</a>,
counts the points in an angled hex grid in a box.
</li>
<li>
<a href = "hexagon_contains_point_2d.m">
hexagon_contains_point_2d.m</a>,
is TRUE if a point is contained in a hexagon.
</li>
<li>
<a href = "i4_modp.m">
i4_modp.m</a>,
returns the remainder of integer division, but always positive.
</li>
<li>
<a href = "i4_wrap.m">
i4_wrap.m</a>,
forces an integer to lie between two values.
</li>
<li>
<a href = "p00_boundary_eps.m">
p00_boundary_eps.m</a>,
draws the boundary of the region for any problem.
</li>
<li>
<a href = "p00_boundary_nearest.m">
p00_boundary_nearest.m</a>,
returns the nearest boundary point for any problem.
</li>
<li>
<a href = "p00_boundary_segment.m">
p00_boundary_segment.m</a>,
returns points on a boundary segment for any problem.
</li>
<li>
<a href = "p00_boundary_segment_length.m">
p00_boundary_segment_length.m</a>,
returns the number of points to use for boundary segments
for any problem.
</li>
<li>
<a href = "p00_boundary_segment_num.m">
p00_boundary_segment_num.m</a>,
returns the number of boundary segments for any problem.
</li>
<li>
<a href = "p00_box.m">p00_box.m</a>,
returns a bounding box for any problem.
</li>
<li>
<a href = "p00_density.m">
p00_density.m</a>,
returns the mesh density for any problem.
</li>
<li>
<a href = "p00_element_size.m">
p00_element_size.m</a>,
returns a suggested element size for any problem.
</li>
<li>
<a href = "p00_fixed_num.m">
p00_fixed_num.m</a>,
returns the number of fixed points for any problem.
</li>
<li>
<a href = "p00_fixed_points.m">
p00_fixed_points.m</a>,
returns the fixed points for any problem.
</li>
<li>
<a href = "p00_header.m">
p00_header.m</a>,
prints the header for any problem.
</li>
<li>
<a href = "p00_hex_grid.m">
p00_hex_grid.m</a>,
returns hex grid points in a region.
</li>
<li>
<a href = "p00_hex_grid_count.m">
p00_hex_grid_count.m</a>,
counts the number of hex grid points in a region.
</li>
<li>
<a href = "p00_hole_num.m">
p00_hole_num.m</a>,
returns the number of holes in the region for any problem.
</li>
<li>
<a href = "p00_hole_point.m">
p00_hole_point.m</a>,
returns a point in a hole in the region for any problem.
</li>
<li>
<a href = "p00_inside.m">
p00_inside.m</a>,
is TRUE for each point that is inside the region, for any problem.
</li>
<li>
<a href = "p00_points_eps.m">
p00_points_eps.m</a>,
draws a plot of the region and some sample points
for any problem.
</li>
<li>
<a href = "p00_poly_write.m">
p00_poly_write.m</a>,
assembles geometric information and writes it as a POLY file
for any problem.
</li>
<li>
<a href = "p00_sample.m">
p00_sample.m</a>,
returns sample points from the region for any problem.
</li>
<li>
<a href = "p00_test_num.m">
p00_test_num.m</a>,
returns the number of problems.
</li>
<li>
<a href = "p00_title.m">
p00_title.m</a>,
returns the title for any problem.
</li>
<li>
<a href = "p01_boundary_nearest.m">
p01_boundary_nearest.m</a>,
returns the nearest boundary point for problem 01.
</li>
<li>
<a href = "p01_boundary_project.m">
p01_boundary_project.m</a>,
projects exterior points onto the boundary for problem 01.
</li>
<li>
<a href = "p01_boundary_segment.m">
p01_boundary_segment.m</a>,
returns points on a boundary segment for problem 01.
</li>
<li>
<a href = "p01_boundary_segment_length.m">
p01_boundary_segment_length.m</a>,
returns the number of points to use for boundary segments
for problem 01.
</li>
<li>
<a href = "p01_boundary_segment_num.m">
p01_boundary_segment_num.m</a>,
returns the number of boundary segments for problem 01.
</li>
<li>
<a href = "p01_box.m">p01_box.m</a>,
returns a bounding box for problem 01.
</li>
<li>
<a href = "p01_density.m">p01_density.m</a>,
returns the mesh density for problem 01.
</li>
<li>
<a href = "p01_element_size.m">
p01_element_size.m</a>,
returns a suggested element size for problem 01.
</li>
<li>
<a href = "p01_fixed_num.m">
p01_fixed_num.m</a>,
returns the number of fixed points for problem 01.
</li>
<li>
<a href = "p01_fixed_points.m">
p01_fixed_points.m</a>,
returns the fixed points for problem 01.
</li>
<li>
<a href = "p01_header.m">p01_header.m</a>,
prints the header for problem 01.
</li>
<li>
<a href = "p01_hole_num.m">
p01_hole_num.m</a>,
returns the number of holes in the region for problem 01.
</li>
<li>
<a href = "p01_hole_point.m">
p01_hole_point.m</a>,
returns a point in a hole in the region for problem 01.
</li>
<li>
<a href = "p01_inside.m">p01_inside.m</a>,
is TRUE for each point inside the region in problem 01.
</li>
<li>
<a href = "p01_sample.m">
p01_sample.m</a>,
returns sample points from the region for problem 01.
</li>
<li>
<a href = "p01_title.m">p01_title.m</a>,
returns a title for problem 01.
</li>
<li>
<a href = "p02_boundary_nearest.m">
p02_boundary_nearest.m</a>,
returns the nearest boundary point for problem 02.
</li>
<li>
<a href = "p02_boundary_segment.m">
p02_boundary_segment.m</a>,
returns points on a boundary segment for problem 02.
</li>
<li>
<a href = "p02_boundary_segment_length.m">
p02_boundary_segment_length.m</a>,
returns the number of points to use for boundary segments
for problem 02.
</li>
<li>
<a href = "p02_boundary_segment_num.m">
p02_boundary_segment_num.m</a>,
returns the number of boundary segments for problem 02.
</li>
<li>
<a href = "p02_box.m">p02_box.m</a>,
returns a bounding box for problem 02.
</li>
<li>
<a href = "p02_density.m">p02_density.m</a>,
returns the mesh density for problem 02.
</li>
<li>
<a href = "p02_element_size.m">
p02_element_size.m</a>,
returns a suggested element size for problem 02.
</li>
<li>
<a href = "p02_fixed_num.m">
p02_fixed_num.m</a>,
returns the number of fixed points for problem 02.
</li>
<li>
<a href = "p02_fixed_points.m">
p02_fixed_points.m</a>,
returns the fixed points for problem 02.
</li>
<li>
<a href = "p02_header.m">p02_header.m</a>,
prints the header for problem 02.
</li>
<li>
<a href = "p02_hole_num.m">
p02_hole_num.m</a>,
returns the number of holes in the region for problem 02.
</li>
<li>
<a href = "p02_hole_point.m">
p02_hole_point.m</a>,
returns a point in a hole in the region for problem 02.
</li>
<li>
<a href = "p02_inside.m">p02_inside.m</a>,
is TRUE for each point inside the region in problem 02.
</li>
<li>
<a href = "p02_sample.m">
p02_sample.m</a>,
returns sample points from the region for problem 02.
</li>
<li>
<a href = "p02_title.m">p02_title.m</a>,
returns a title for problem 02.
</li>
<li>
<a href = "p03_boundary_nearest.m">
p03_boundary_nearest.m</a>,
returns the nearest boundary point for problem 03.
</li>
<li>
<a href = "p03_boundary_segment.m">
p03_boundary_segment.m</a>,
returns points on a boundary segment for problem 03.
</li>
<li>
<a href = "p03_boundary_segment_length.m">
p03_boundary_segment_length.m</a>,
returns the number of points to use for boundary segments
for problem 03.
</li>
<li>
<a href = "p03_boundary_segment_num.m">
p03_boundary_segment_num.m</a>,
returns the number of boundary segments for problem 03.
</li>
<li>
<a href = "p03_box.m">p03_box.m</a>,
returns a bounding box for problem 03.
</li>
<li>
<a href = "p03_density.m">p03_density.m</a>,
returns the mesh density for problem 03.
</li>
<li>
<a href = "p03_element_size.m">
p03_element_size.m</a>,
returns a suggested element size for problem 03.
</li>
<li>
<a href = "p03_fixed_num.m">
p03_fixed_num.m</a>,
returns the number of fixed points for problem 03.
</li>
<li>
<a href = "p03_fixed_points.m">
p03_fixed_points.m</a>,
returns the fixed points for problem 03.
</li>
<li>
<a href = "p03_header.m">p03_header.m</a>,
prints the header for problem 03.
</li>
<li>
<a href = "p03_hole_num.m">
p03_hole_num.m</a>,
returns the number of holes in the region for problem 03.
</li>
<li>
<a href = "p03_hole_point.m">
p03_hole_point.m</a>,
returns a point in a hole in the region for problem 03.
</li>
<li>
<a href = "p03_inside.m">p03_inside.m</a>,
is TRUE for each point inside the region in problem 03.
</li>
<li>
<a href = "p03_sample.m">
p03_sample.m</a>,
returns sample points from the region for problem 03.
</li>
<li>
<a href = "p03_title.m">p03_title.m</a>,
returns a title for problem 03.
</li>
<li>
<a href = "p04_boundary_nearest.m">
p04_boundary_nearest.m</a>,
returns the nearest boundary point for problem 04.
</li>
<li>
<a href = "p04_boundary_segment.m">
p04_boundary_segment.m</a>,
returns points on a boundary segment for problem 04.
</li>
<li>
<a href = "p04_boundary_segment_length.m">
p04_boundary_segment_length.m</a>,
returns the number of points to use for boundary segments
for problem 04.
</li>
<li>
<a href = "p04_boundary_segment_num.m">
p04_boundary_segment_num.m</a>,
returns the number of boundary segments for problem 04.
</li>
<li>
<a href = "p04_box.m">p04_box.m</a>,
returns a bounding box for problem 04.
</li>
<li>
<a href = "p04_density.m">p04_density.m</a>,
returns the mesh density for problem 04.
</li>
<li>
<a href = "p04_element_size.m">
p04_element_size.m</a>,
returns a suggested element size for problem 04.
</li>
<li>
<a href = "p04_fixed_num.m">
p04_fixed_num.m</a>,
returns the number of fixed points for problem 04.
</li>
<li>
<a href = "p04_fixed_points.m">
p04_fixed_points.m</a>,
returns the fixed points for problem 04.
</li>
<li>
<a href = "p04_header.m">p04_header.m</a>,
prints the header for problem 04.
</li>
<li>
<a href = "p04_hole_num.m">
p04_hole_num.m</a>,
returns the number of holes in the region for problem 04.
</li>
<li>
<a href = "p04_hole_point.m">
p04_hole_point.m</a>,
returns a point in a hole in the region for problem 04.
</li>
<li>
<a href = "p04_inside.m">p04_inside.m</a>,
is TRUE for each point inside the region in problem 04.
</li>
<li>
<a href = "p04_sample.m">
p04_sample.m</a>,
returns sample points from the region for problem 04.
</li>
<li>
<a href = "p04_title.m">p04_title.m</a>,
returns a title for problem 04.
</li>
<li>
<a href = "p05_boundary_nearest.m">
p05_boundary_nearest.m</a>,
returns the nearest boundary point for problem 05.
</li>
<li>
<a href = "p05_boundary_segment.m">
p05_boundary_segment.m</a>,
returns points on a boundary segment for problem 05.
</li>
<li>
<a href = "p05_boundary_segment_length.m">
p05_boundary_segment_length.m</a>,
returns the number of points to use for boundary segments
for problem 05.
</li>
<li>
<a href = "p05_boundary_segment_num.m">
p05_boundary_segment_num.m</a>,
returns the number of boundary segments for problem 05.
</li>
<li>
<a href = "p05_box.m">p05_box.m</a>,
returns a bounding box for problem 05.
</li>
<li>
<a href = "p05_density.m">p05_density.m</a>,
returns the mesh density for problem 05.
</li>
<li>
<a href = "p05_element_size.m">
p05_element_size.m</a>,
returns a suggested element size for problem 05.
</li>
<li>
<a href = "p05_fixed_num.m">
p05_fixed_num.m</a>,
returns the number of fixed points for problem 05.
</li>
<li>
<a href = "p05_fixed_points.m">
p05_fixed_points.m</a>,
returns the fixed points for problem 05.
</li>
<li>
<a href = "p05_header.m">p05_header.m</a>,
prints the header for problem 05.
</li>
<li>
<a href = "p05_hole_num.m">
p05_hole_num.m</a>,
returns the number of holes in the region for problem 05.
</li>
<li>
<a href = "p05_hole_point.m">
p05_hole_point.m</a>,
returns a point in a hole in the region for problem 05.
</li>
<li>
<a href = "p05_inside.m">p05_inside.m</a>,
is TRUE for each point inside the region in problem 05.
</li>
<li>
<a href = "p05_sample.m">
p05_sample.m</a>,
returns sample points from the region for problem 05.
</li>
<li>
<a href = "p05_title.m">p05_title.m</a>,
returns a title for problem 05.
</li>
<li>
<a href = "p06_boundary_nearest.m">
p06_boundary_nearest.m</a>,
returns the nearest boundary point for problem 06.
</li>
<li>
<a href = "p06_boundary_segment_num.m">
p06_boundary_segment_num.m</a>,
returns the number of boundary segments for problem 06.
</li>
<li>
<a href = "p06_boundary_segment_length.m">
p06_boundary_segment_length.m</a>,
returns the number of points to use for boundary segments
for problem 06.
</li>
<li>
<a href = "p06_boundary_segment_num.m">
p06_boundary_segment_num.m</a>,
returns the number of boundary segments for problem 06.
</li>
<li>
<a href = "p06_box.m">p06_box.m</a>,
returns a bounding box for problem 06.
</li>
<li>
<a href = "p06_density.m">p06_density.m</a>,
returns the mesh density for problem 06.
</li>
<li>
<a href = "p06_element_size.m">
p06_element_size.m</a>,
returns a suggested element size for problem 06.
</li>
<li>
<a href = "p06_fixed_num.m">
p06_fixed_num.m</a>,
returns the number of fixed points for problem 06.
</li>
<li>
<a href = "p06_fixed_points.m">
p06_fixed_points.m</a>,
returns the fixed points for problem 06.
</li>
<li>
<a href = "p06_header.m">p06_header.m</a>,
prints the header for problem 06.
</li>
<li>
<a href = "p06_hole_num.m">
p06_hole_num.m</a>,
returns the number of holes in the region for problem 06.
</li>
<li>
<a href = "p06_hole_point.m">
p06_hole_point.m</a>,
returns a point in a hole in the region for problem 06.
</li>
<li>
<a href = "p06_inside.m">p06_inside.m</a>,
is TRUE for each point inside the region in problem 06.
</li>
<li>
<a href = "p06_sample.m">
p06_sample.m</a>,
returns sample points from the region for problem 06.
</li>
<li>
<a href = "p06_title.m">p06_title.m</a>,
returns a title for problem 06.
</li>
<li>
<a href = "p07_boundary_nearest.m">
p07_boundary_nearest.m</a>,
returns the nearest boundary point for problem 07.
</li>
<li>
<a href = "p07_boundary_segment_num.m">
p07_boundary_segment_num.m</a>,
returns the number of boundary segments for problem 07.
</li>
<li>
<a href = "p07_boundary_segment_length.m">
p07_boundary_segment_length.m</a>,
returns the number of points to use for boundary segments
for problem 07.
</li>
<li>
<a href = "p07_boundary_segment_num.m">
p07_boundary_segment_num.m</a>,
returns the number of boundary segments for problem 07.
</li>
<li>
<a href = "p07_box.m">p07_box.m</a>,
returns a bounding box for problem 07.
</li>
<li>
<a href = "p07_density.m">p07_density.m</a>,
returns the mesh density for problem 07.
</li>
<li>
<a href = "p07_element_size.m">
p07_element_size.m</a>,
returns a suggested element size for problem 07.
</li>
<li>
<a href = "p07_fixed_num.m">
p07_fixed_num.m</a>,
returns the number of fixed points for problem 07.
</li>
<li>
<a href = "p07_fixed_points.m">
p07_fixed_points.m</a>,
returns the fixed points for problem 07.
</li>
<li>
<a href = "p07_header.m">p07_header.m</a>,
prints the header for problem 07.
</li>
<li>
<a href = "p07_hole_num.m">
p07_hole_num.m</a>,
returns the number of holes in the region for problem 07.
</li>
<li>
<a href = "p07_hole_point.m">
p07_hole_point.m</a>,
returns a point in a hole in the region for problem 07.
</li>
<li>
<a href = "p07_inside.m">p07_inside.m</a>,
is TRUE for each point inside the region in problem 07.
</li>
<li>
<a href = "p07_sample.m">
p07_sample.m</a>,
returns sample points from the region for problem 07.
</li>
<li>
<a href = "p07_title.m">p07_title.m</a>,
returns a title for problem 07.
</li>
<li>
<a href = "p08_boundary_nearest.m">
p08_boundary_nearest.m</a>,
returns the nearest boundary point for problem 08.
</li>
<li>
<a href = "p08_boundary_segment.m">
p08_boundary_segment.m</a>,
returns points on a boundary segment for problem 08.
</li>
<li>
<a href = "p08_boundary_segment_length.m">
p08_boundary_segment_length.m</a>,
returns the number of points on a boundary segment for problem 08.
</li>
<li>
<a href = "p08_boundary_segment_num.m">p08_boundary_segment_num.m</a>,
returns the number of boundary segments for problem 08.
</li>
<li>
<a href = "p08_box.m">p08_box.m</a>,
returns a bounding box for problem 08.
</li>
<li>
<a href = "p08_density.m">p08_density.m</a>,
returns the mesh density for problem 08.
</li>
<li>
<a href = "p08_element_size.m">p08_element_size.m</a>,
returns the element size for problem 08.
</li>
<li>
<a href = "p08_fixed_num.m">p08_fixed_num.m</a>,
returns the number of fixed points for problem 08.
</li>
<li>
<a href = "p08_fixed_points.m">p08_fixed_points.m</a>,
returns the fixed points for problem 08.
</li>