[struther@gossamer Scewchuk]$ triangle A.poly 
Opening A.poly.
Constructing Delaunay triangulation by divide-and-conquer method.
Delaunay milliseconds:  0
Recovering segments in Delaunay triangulation.
Segment milliseconds:  0
Removing unwanted triangles.
Hole milliseconds:  0

Writing A.1.node.
Writing A.1.ele.
Writing A.1.poly.

Output milliseconds:  50
Total running milliseconds:  51

Statistics:

  Input vertices: 29
  Input segments: 29
  Input holes: 1

  Mesh vertices: 29
  Mesh triangles: 29
  Mesh edges: 58
  Mesh exterior boundary edges: 29
  Mesh interior boundary edges: 0
  Mesh subsegments (constrained edges): 29

[struther@gossamer Scewchuk]$