Input point set:

Point    0:  0  0   attributes  0   marker 0
Point    1:  1  0   attributes  1   marker 2
Point    2:  1  10   attributes  11   marker 0
Point    3:  0  10   attributes  10   marker 0

Constructing Delaunay triangulation by divide-and-conquer method.
Delaunay milliseconds:  0
Recovering segments in Delaunay triangulation.
Segment milliseconds:  0
Removing unwanted triangles.
Spreading regional attributes.
Hole milliseconds:  0

Writing vertices.
Writing triangles.
Writing segments.
Writing edges.
Writing Voronoi vertices.
Writing Voronoi edges.
Writing neighbors.

Output milliseconds:  0
Total running milliseconds:  0

Statistics:

  Input vertices: 4
  Input segments: 0
  Input holes: 0

  Mesh vertices: 4
  Mesh triangles: 2
  Mesh edges: 5
  Mesh exterior boundary edges: 4
  Mesh interior boundary edges: 0
  Mesh subsegments (constrained edges): 4

Initial triangulation:

Point    0:  0  0   attributes  0   marker 1
Point    1:  1  0   attributes  1   marker 2
Point    2:  1  10   attributes  11   marker 1
Point    3:  0  10   attributes  10   marker 1

Triangle    0 points:     3     0     1   attributes  7
Triangle    0 neighbors:    -1     1    -1
Triangle    1 points:     1     2     3   attributes  7
Triangle    1 neighbors:    -1     0    -1

Segment    0 points:     1     0   marker 1
Segment    1 points:     2     1   marker 1
Segment    2 points:     3     2   marker 1
Segment    3 points:     0     3   marker 1

Edge    0 points:     3     0   marker 1
Edge    1 points:     0     1   marker 1
Edge    2 points:     1     3   marker 0
Edge    3 points:     1     2   marker 1
Edge    4 points:     2     3   marker 1

Initial Voronoi diagram:

Point    0:  0.5  5   attributes  5.5
Point    1:  0.5  5   attributes  5.5

Edge    0 points:     0    -1  -10  0
Edge    1 points:     0    -1  0  -1
Edge    2 points:     0     1
Edge    3 points:     1    -1  10  0
Edge    4 points:     1    -1  0  1

Reconstructing mesh.
Mesh reconstruction milliseconds:  0
Adding Steiner points to enforce quality.
Quality milliseconds:  0

Writing vertices.
Writing triangles.
NOT writing segments.

Output milliseconds:  0
Total running milliseconds:  0

Statistics:

  Input vertices: 4
  Input triangles: 2
  Input segments: 4

  Mesh vertices: 10
  Mesh triangles: 8
  Mesh edges: 17
  Mesh exterior boundary edges: 10
  Mesh interior boundary edges: 0
  Mesh subsegments (constrained edges): 10

Refined triangulation:

Point    0:  0  0   attributes  0
Point    1:  1  0   attributes  1
Point    2:  1  10   attributes  11
Point    3:  0  10   attributes  10
Point    4:  0  4   attributes  4
Point    5:  1  5   attributes  6
Point    6:  1  2.5   attributes  3.5
Point    7:  0  7   attributes  7
Point    8:  0  2   attributes  2
Point    9:  1  7.5   attributes  8.5

Triangle    0 points:     1     6     8   attributes  7
Triangle    1 points:     7     4     5   attributes  7
Triangle    2 points:     9     3     7   attributes  7
Triangle    3 points:     4     6     5   attributes  7
Triangle    4 points:     1     8     0   attributes  7
Triangle    5 points:     3     9     2   attributes  7
Triangle    6 points:     6     4     8   attributes  7
Triangle    7 points:     7     5     9   attributes  7