#  double_hex3.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 16 nodes, 4 on the outer boundary and 6 on each of
#    the two hexagons.
#
#  Licensing:
#
#    This code is distributed under the GNU LGPL license.
#
#  Modified:
#
#    03 June 2012
#
#
#  Declare 16 vertices, 2 dimensions, 0 attributes, 1 boundary markers.
#
16  2  0  1
#
#  List the vertices by index, x, y, and boundary marker.
#
 1  0.0000    0.0000  1
 2  1.0000    0.0000  1
 3  1.0000    1.0000  1
 4  0.0000    1.0000  1
#
#  Points around hexagonal hole 1.
#
 5  0.1500    0.7500  2
 6  0.2003    0.6634  2
 7  0.3002    0.6640  2
 8  0.3500    0.7500  2
 9  0.3002    0.8360  2
10  0.2003    0.8366  2
#
#  Points around hexagonal hole 2.
#
11  0.5000    0.4000  3
12  0.5503    0.3134  3
13  0.6502    0.3140  3
14  0.7000    0.4000  3
15  0.6502    0.4860  3
16  0.5503    0.4866  3
#
#  Declare the number of segments and the number of boundary markers.
#
  16 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   1  1
#
#  Segment 2 around the first hexagonal hole.
#  I give the holes a clockwise ordering, but this is not required.
#
 5   5   6  2
 6   6   7  2
 7   7   8  2
 8   8   9  2
 9   9  10  2
10  10   5  2
#
#  Segment 3 around the second hexagonal hole.
#
11  11  12  3
12  12  13  3
13  13  14  3
14  14  15  3
15  15  16  3
16  16  11  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