#  double_hex2.poly
#
#  Discussion:
#
#    This file describes a rectangular region with two hexagonal holes.
#    It describes a problem provided by Jeff Borggaard of Virginia Tech.
#
#    The entire region is a subset of the unit square.
#
#    There are 48 nodes, 36 on the outer boundary and 6 on each of
#    the two hexagons.
#
#    This file represents half the resolution of the data in the file
#    double_hex.poly.
#
#  Licensing:
#
#    This code is distributed under the GNU LGPL license.
#
#  Modified:
#
#    03 January 2004
#
#
#  Declare 48 vertices, 2 dimensions, 0 attributes, 1 boundary markers.
#
48  2  0  1
#
#  List the vertices by index, x, y, and boundary marker.
#
 1  0.0000    0.0000  1
 2  0.1111    0.0000  1
 3  0.2222    0.0000  1
 4  0.3333    0.0000  1
 5  0.4444    0.0000  1
 6  0.5556    0.0000  1
 7  0.6667    0.0000  1
 8  0.7778    0.0000  1
 9  0.8889    0.0000  1
10  1.0000    0.0000  1
11  1.0000    0.1111  1
12  1.0000    0.2222  1
13  1.0000    0.3333  1
14  1.0000    0.4444  1
15  1.0000    0.5556  1
16  1.0000    0.6667  1
17  1.0000    0.7778  1
18  1.0000    0.8889  1
19  1.0000    1.0000  1
20  0.8889    1.0000  1
21  0.7778    1.0000  1
22  0.6667    1.0000  1
23  0.5556    1.0000  1
24  0.4444    1.0000  1
25  0.3333    1.0000  1
26  0.2222    1.0000  1
27  0.1111    1.0000  1
28  0.0000    1.0000  1
29  0.0000    0.8889  1
30  0.0000    0.7778  1
31  0.0000    0.6667  1
32  0.0000    0.5556  1
33  0.0000    0.4444  1
34  0.0000    0.3333  1
35  0.0000    0.2222  1
36  0.0000    0.1111  1
#
#  Points around hexagonal hole 1.
#
37  0.1500    0.7500  2
38  0.2003    0.6634  2
39  0.3002    0.6640  2
40  0.3500    0.7500  2
41  0.3002    0.8360  2
42  0.2003    0.8366  2
#
#  Points around hexagonal hole 2.
#
43  0.5000    0.4000  3
44  0.5503    0.3134  3
45  0.6502    0.3140  3
46  0.7000    0.4000  3
47  0.6502    0.4860  3
48  0.5503    0.4866  3
#
#  Declare the number of segments and the number of boundary markers.
#
  48 1
#
#  List the segments by index, start and end node, and boundary marker.
#
#  Segment 1
#  I list these segments in counterclockwise order, but this is not required.
#
 1   1   2  1
 2   2   3  1
 3   3   4  1
 4   4   5  1
 5   5   6  1
 6   6   7  1
 7   7   8  1
 8   8   9  1
 9   9  10  1
10  10  11  1
11  11  12  1
12  12  13  1
13  13  14  1
14  14  15  1
15  15  16  1
16  16  17  1
17  17  18  1
18  18  19  1
19  19  20  1
20  20  21  1
21  21  22  1
22  22  23  1
23  23  24  1
24  24  25  1
25  25  26  1
26  26  27  1
27  27  28  1
28  28  29  1
29  29  30  1
30  30  31  1
31  31  32  1
32  32  33  1
33  33  34  1
34  34  35  1
35  35  36  1
36  36   1  1
#
#  Segment 2 around the first hexagonal hole.
#  I give the holes a clockwise ordering, but this is not required.
#
37  37  38  2
38  38  39  2
39  39  40  2
40  40  41  2ls -
41  41  42  2
42  42  37  2
#
#  Segment 3 around the second hexagonal hole.
#
43  43  44  3
44  44  45  3
45  45  46  3
46  46  47  3
47  47  48  3
48  48  43  3
#
#  Declare the number of holes.
#
 2
#
#  Define a hole by giving the coordinates of one point inside it.
#
 1  0.2500  0.7500
 2  0.6000  0.4000