meshdemo_2d
06-Feb-2006 13:11:26

MESHDEMO_2D
  Demonstrations of the use of DISTMESH.

Problem 1:
  Unit circle, h = 0.400000
  10 iterations,  5 triangulations.
  20 iterations,  7 triangulations.
  30 iterations,  7 triangulations.

  19 nodes were used.
  24 triangles were created.

  The minimum simplex quality was 1.89
  (A value of 1.00 is best, and 0.00 is the worst.)
  The simplex uniformity was 3.6%
  (A value of 5% or less is good.)

   (press any key)

Problem 1:
  Unit circle, h = 0.200000
  10 iterations,  5 triangulations.
  20 iterations,  8 triangulations.
  30 iterations,  10 triangulations.
  40 iterations,  12 triangulations.
  50 iterations,  13 triangulations.
  60 iterations,  14 triangulations.
  70 iterations,  15 triangulations.
  80 iterations,  15 triangulations.
  90 iterations,  15 triangulations.
  100 iterations,  15 triangulations.
  110 iterations,  15 triangulations.
  120 iterations,  15 triangulations.

  88 nodes were used.
  143 triangles were created.

  The minimum simplex quality was 1.46
  (A value of 1.00 is best, and 0.00 is the worst.)
  The simplex uniformity was 4.0%
  (A value of 5% or less is good.)

   (press any key)

Problem 1:
  Unit circle, h = 0.100000
  10 iterations,  5 triangulations.
  20 iterations,  7 triangulations.
  30 iterations,  9 triangulations.
  40 iterations,  11 triangulations.
  50 iterations,  12 triangulations.
  60 iterations,  14 triangulations.
  70 iterations,  15 triangulations.
  80 iterations,  16 triangulations.
  90 iterations,  16 triangulations.
  100 iterations,  17 triangulations.
  110 iterations,  17 triangulations.
  120 iterations,  17 triangulations.
  130 iterations,  17 triangulations.
  140 iterations,  17 triangulations.
  150 iterations,  17 triangulations.
  160 iterations,  18 triangulations.
  170 iterations,  18 triangulations.
  180 iterations,  18 triangulations.
  190 iterations,  18 triangulations.
  200 iterations,  19 triangulations.

  362 nodes were used.
  661 triangles were created.

  The minimum simplex quality was 1.60
  (A value of 1.00 is best, and 0.00 is the worst.)
  The simplex uniformity was 2.3%
  (A value of 5% or less is good.)

   (press any key)

Problem 2:
  Unit circle with a hole, h = 0.100000
  10 iterations,  6 triangulations.
  20 iterations,  9 triangulations.
  30 iterations,  11 triangulations.
  40 iterations,  12 triangulations.
  50 iterations,  14 triangulations.
  60 iterations,  15 triangulations.
  70 iterations,  16 triangulations.
  80 iterations,  17 triangulations.
  90 iterations,  18 triangulations.
  100 iterations,  18 triangulations.
  110 iterations,  19 triangulations.
  120 iterations,  19 triangulations.
  130 iterations,  19 triangulations.
  140 iterations,  19 triangulations.
  150 iterations,  19 triangulations.
  160 iterations,  20 triangulations.
  170 iterations,  20 triangulations.
  180 iterations,  20 triangulations.
  190 iterations,  20 triangulations.
  200 iterations,  20 triangulations.

  303 nodes were used.
  522 triangles were created.

  The minimum simplex quality was 0.63
  (A value of 1.00 is best, and 0.00 is the worst.)
  The simplex uniformity was 6.4%
  (A value of 5% or less is good.)

   (press any key)

Problem 3:
  The square with a hole, h = 0.150000
  10 iterations,  7 triangulations.
  20 iterations,  9 triangulations.
  30 iterations,  10 triangulations.
  40 iterations,  11 triangulations.
  50 iterations,  13 triangulations.
  60 iterations,  14 triangulations.
  70 iterations,  14 triangulations.
  80 iterations,  15 triangulations.
  90 iterations,  16 triangulations.
  100 iterations,  17 triangulations.
  110 iterations,  19 triangulations.
  120 iterations,  20 triangulations.
  130 iterations,  20 triangulations.
  140 iterations,  21 triangulations.
  150 iterations,  23 triangulations.
  160 iterations,  23 triangulations.
  170 iterations,  24 triangulations.
  180 iterations,  25 triangulations.
  190 iterations,  26 triangulations.
  200 iterations,  26 triangulations.

  194 nodes were used.
  315 triangles were created.

  The minimum simplex quality was 1.35
  (A value of 1.00 is best, and 0.00 is the worst.)
  The simplex uniformity was 3.4%
  (A value of 5% or less is good.)

   (press any key)

Problem 3:
  The square with a hole, h = 0.050000
  10 iterations,  9 triangulations.
  20 iterations,  19 triangulations.
  30 iterations,  29 triangulations.
  40 iterations,  34 triangulations.
  50 iterations,  39 triangulations.
  60 iterations,  43 triangulations.
  70 iterations,  46 triangulations.
  80 iterations,  49 triangulations.
  90 iterations,  51 triangulations.
  100 iterations,  53 triangulations.
  110 iterations,  55 triangulations.
  120 iterations,  56 triangulations.
  130 iterations,  57 triangulations.
  140 iterations,  59 triangulations.
  150 iterations,  60 triangulations.
  160 iterations,  63 triangulations.
  170 iterations,  65 triangulations.
  180 iterations,  68 triangulations.
  190 iterations,  72 triangulations.
  200 iterations,  78 triangulations.
  210 iterations,  80 triangulations.
  220 iterations,  82 triangulations.
  230 iterations,  84 triangulations.
  240 iterations,  86 triangulations.
  250 iterations,  88 triangulations.
  260 iterations,  90 triangulations.
  270 iterations,  92 triangulations.
  280 iterations,  94 triangulations.
  290 iterations,  96 triangulations.
  300 iterations,  98 triangulations.

  274 nodes were used.
  452 triangles were created.

  The minimum simplex quality was 1.12
  (A value of 1.00 is best, and 0.00 is the worst.)
  The simplex uniformity was 4.1%
  (A value of 5% or less is good.)

   (press any key)

Problem 4:
  Hexagon with a hexagonal hole, h = 0.100000
  10 iterations,  6 triangulations.
  20 iterations,  9 triangulations.
  30 iterations,  10 triangulations.
  40 iterations,  11 triangulations.
  50 iterations,  13 triangulations.
  60 iterations,  14 triangulations.
  70 iterations,  15 triangulations.
  80 iterations,  15 triangulations.
  90 iterations,  15 triangulations.
  100 iterations,  15 triangulations.
  110 iterations,  16 triangulations.
  120 iterations,  16 triangulations.
  130 iterations,  16 triangulations.
  140 iterations,  16 triangulations.
  150 iterations,  16 triangulations.
  160 iterations,  17 triangulations.
  170 iterations,  17 triangulations.
  180 iterations,  17 triangulations.
  190 iterations,  17 triangulations.
  200 iterations,  17 triangulations.

  240 nodes were used.
  385 triangles were created.

  The minimum simplex quality was 1.44
  (A value of 1.00 is best, and 0.00 is the worst.)
  The simplex uniformity was 3.7%
  (A value of 5% or less is good.)

   (press any key)

Problem 5:
  The horn, h = 0.020000
  10 iterations,  9 triangulations.
  20 iterations,  19 triangulations.
  30 iterations,  29 triangulations.
  40 iterations,  39 triangulations.
  50 iterations,  45 triangulations.
  60 iterations,  55 triangulations.
  70 iterations,  61 triangulations.
  80 iterations,  65 triangulations.
  90 iterations,  68 triangulations.
  100 iterations,  70 triangulations.
  110 iterations,  72 triangulations.
  120 iterations,  74 triangulations.
  130 iterations,  76 triangulations.
  140 iterations,  79 triangulations.
  150 iterations,  82 triangulations.
  160 iterations,  84 triangulations.
  170 iterations,  85 triangulations.
  180 iterations,  86 triangulations.
  190 iterations,  88 triangulations.
  200 iterations,  89 triangulations.

  128 nodes were used.
  179 triangles were created.

  The minimum simplex quality was 1.30
  (A value of 1.00 is best, and 0.00 is the worst.)
  The simplex uniformity was 4.9%
  (A value of 5% or less is good.)

   (press any key)

Problem 8:
  The holey pie slice, h = 0.025000
  10 iterations,  6 triangulations.
  20 iterations,  9 triangulations.
  30 iterations,  10 triangulations.
  40 iterations,  12 triangulations.
  50 iterations,  13 triangulations.
  60 iterations,  15 triangulations.
  70 iterations,  16 triangulations.
  80 iterations,  17 triangulations.
  90 iterations,  18 triangulations.
  100 iterations,  19 triangulations.
  110 iterations,  20 triangulations.
  120 iterations,  20 triangulations.
  130 iterations,  21 triangulations.
  140 iterations,  21 triangulations.
  150 iterations,  22 triangulations.
  160 iterations,  22 triangulations.
  170 iterations,  23 triangulations.
  180 iterations,  23 triangulations.
  190 iterations,  24 triangulations.
  200 iterations,  24 triangulations.

  417 nodes were used.
  713 triangles were created.

  The minimum simplex quality was 0.15
  (A value of 1.00 is best, and 0.00 is the worst.)
  The simplex uniformity was 12.2%
  (A value of 5% or less is good.)

   (press any key)

Problem 8:
  The holey pie slice, h = 0.005000
  10 iterations,  9 triangulations.
  20 iterations,  19 triangulations.
  30 iterations,  29 triangulations.
  40 iterations,  39 triangulations.
  50 iterations,  49 triangulations.
  60 iterations,  59 triangulations.
  70 iterations,  65 triangulations.
  80 iterations,  70 triangulations.
  90 iterations,  74 triangulations.
  100 iterations,  79 triangulations.
  110 iterations,  84 triangulations.
  120 iterations,  89 triangulations.
  130 iterations,  94 triangulations.
  140 iterations,  98 triangulations.
  150 iterations,  103 triangulations.
  160 iterations,  108 triangulations.
  170 iterations,  111 triangulations.
  180 iterations,  116 triangulations.
  190 iterations,  123 triangulations.
  200 iterations,  125 triangulations.

  496 nodes were used.
  850 triangles were created.

  The minimum simplex quality was 0.01
  (A value of 1.00 is best, and 0.00 is the worst.)
  The simplex uniformity was 21.1%
  (A value of 5% or less is good.)

   (press any key)

Problem 09:
  Jeff Borggaard's square with hexagonal holes, h = 0.080000
  10 iterations,  8 triangulations.
  20 iterations,  10 triangulations.
  30 iterations,  12 triangulations.
  40 iterations,  13 triangulations.
  50 iterations,  13 triangulations.
  60 iterations,  14 triangulations.
  70 iterations,  14 triangulations.
  80 iterations,  15 triangulations.
  90 iterations,  15 triangulations.
  100 iterations,  15 triangulations.
  110 iterations,  16 triangulations.
  120 iterations,  17 triangulations.
  130 iterations,  17 triangulations.
  140 iterations,  17 triangulations.
  150 iterations,  17 triangulations.
  160 iterations,  17 triangulations.
  170 iterations,  18 triangulations.
  180 iterations,  18 triangulations.
  190 iterations,  18 triangulations.
  200 iterations,  18 triangulations.

  203 nodes were used.
  338 triangles were created.

  The minimum simplex quality was 1.42
  (A value of 1.00 is best, and 0.00 is the worst.)
  The simplex uniformity was 3.9%
  (A value of 5% or less is good.)

   (press any key)

Problem 10:
  The Unit square, h = 0.100000
  10 iterations,  6 triangulations.
  20 iterations,  9 triangulations.
  30 iterations,  10 triangulations.
  40 iterations,  11 triangulations.
  50 iterations,  12 triangulations.
  60 iterations,  13 triangulations.
  70 iterations,  13 triangulations.
  80 iterations,  13 triangulations.
  90 iterations,  14 triangulations.
  100 iterations,  14 triangulations.
  110 iterations,  14 triangulations.
  120 iterations,  15 triangulations.
  130 iterations,  15 triangulations.
  140 iterations,  15 triangulations.

  130 nodes were used.
  212 triangles were created.

  The minimum simplex quality was 1.62
  (A value of 1.00 is best, and 0.00 is the worst.)
  The simplex uniformity was 2.6%
  (A value of 5% or less is good.)

   (press any key)

Problem 11:
  The L-shaped region, h = 0.100000
  10 iterations,  6 triangulations.
  20 iterations,  11 triangulations.
  30 iterations,  13 triangulations.
  40 iterations,  14 triangulations.
  50 iterations,  15 triangulations.
  60 iterations,  16 triangulations.
  70 iterations,  18 triangulations.
  80 iterations,  18 triangulations.
  90 iterations,  19 triangulations.
  100 iterations,  19 triangulations.
  110 iterations,  20 triangulations.
  120 iterations,  20 triangulations.
  130 iterations,  21 triangulations.
  140 iterations,  21 triangulations.
  150 iterations,  21 triangulations.
  160 iterations,  21 triangulations.

  102 nodes were used.
  157 triangles were created.

  The minimum simplex quality was 1.57
  (A value of 1.00 is best, and 0.00 is the worst.)
  The simplex uniformity was 3.2%
  (A value of 5% or less is good.)

   (press any key)

Problem 12:
  John Shadid's H-shaped region, h = 0.050000
  10 iterations,  5 triangulations.
  20 iterations,  8 triangulations.
  30 iterations,  11 triangulations.
  40 iterations,  16 triangulations.
  50 iterations,  18 triangulations.
  60 iterations,  19 triangulations.
  70 iterations,  20 triangulations.
  80 iterations,  21 triangulations.
  90 iterations,  21 triangulations.
  100 iterations,  22 triangulations.
  110 iterations,  23 triangulations.
  120 iterations,  24 triangulations.
  130 iterations,  24 triangulations.
  140 iterations,  24 triangulations.
  150 iterations,  25 triangulations.
  160 iterations,  25 triangulations.
  170 iterations,  25 triangulations.
  180 iterations,  26 triangulations.
  190 iterations,  26 triangulations.
  200 iterations,  26 triangulations.

  462 nodes were used.
  790 triangles were created.

  The minimum simplex quality was 1.37
  (A value of 1.00 is best, and 0.00 is the worst.)
  The simplex uniformity was 3.1%
  (A value of 5% or less is good.)

   (press any key)

Problem 13:
  The Sandia Fork, h = 0.025000
  10 iterations,  7 triangulations.
  20 iterations,  9 triangulations.
  30 iterations,  11 triangulations.
  40 iterations,  12 triangulations.
  50 iterations,  18 triangulations.
  60 iterations,  20 triangulations.
  70 iterations,  23 triangulations.
  80 iterations,  23 triangulations.
  90 iterations,  26 triangulations.
  100 iterations,  27 triangulations.
  110 iterations,  30 triangulations.
  120 iterations,  36 triangulations.
  130 iterations,  42 triangulations.
  140 iterations,  48 triangulations.
  150 iterations,  55 triangulations.
  160 iterations,  57 triangulations.
  170 iterations,  60 triangulations.
  180 iterations,  60 triangulations.
  190 iterations,  63 triangulations.
  200 iterations,  63 triangulations.

  326 nodes were used.
  509 triangles were created.

  The minimum simplex quality was 1.48
  (A value of 1.00 is best, and 0.00 is the worst.)
  The simplex uniformity was 3.6%
  (A value of 5% or less is good.)

   (press any key)

Problem 14:
  Marcus Garvie's Lake Alpha, with Beta Island, h = 20.000000
  10 iterations,  7 triangulations.
  20 iterations,  11 triangulations.
  30 iterations,  14 triangulations.
  40 iterations,  16 triangulations.
  50 iterations,  19 triangulations.

  465 nodes were used.
  776 triangles were created.

  The minimum simplex quality was 0.05
  (A value of 1.00 is best, and 0.00 is the worst.)
  The simplex uniformity was 20.1%
  (A value of 5% or less is good.)

   (press any key)

Problem 14:
  Marcus Garvie's Lake Alpha, with Beta Island, h = 10.000000
  10 iterations,  9 triangulations.
  20 iterations,  17 triangulations.
  30 iterations,  22 triangulations.
  40 iterations,  26 triangulations.
  50 iterations,  30 triangulations.

  621 nodes were used.
  974 triangles were created.
Warning: Divide by zero.
> In simpqual at 59
  In post_2d at 38
  In p14_demo at 170
  In meshdemo_2d at 152

  The minimum simplex quality was 0.00
  (A value of 1.00 is best, and 0.00 is the worst.)
  The simplex uniformity was 3120.8%
  (A value of 5% or less is good.)

   (press any key)

Problem 15:
  Sangbum Kim's forward step, h = 0.500000
  10 iterations,  8 triangulations.
  20 iterations,  15 triangulations.
  30 iterations,  22 triangulations.
  40 iterations,  28 triangulations.
  50 iterations,  35 triangulations.

  111 nodes were used.
  143 triangles were created.

  The minimum simplex quality was 1.02
  (A value of 1.00 is best, and 0.00 is the worst.)
  The simplex uniformity was 18.9%
  (A value of 5% or less is good.)