From adjacency graph to triangle mesh

From: Carlos Felippa (carlos_at_colorado.edu)
Date: 11/06/04 

Date: 5 Nov 2004 16:31:37 -0800

Hi - I am looking for a adjacency-graph-to-triangle-corner
code for a class project in mesh generation. Specifically,
given an adjacency graph build by Delaunay, for example

         {{3,4},{3,4},{1,4,2},{2,3,1}}

which can be pictured as

       1 *---------------------------* 3
          + + +
           + + +
            + (1) + +
             + + +
              + + +
               + + +
                + + (2) +
                 + + +
               4 * -----------------* 2

construct the triangle corner list

         ({1,4,3},{2,3,4}}

It is not difficult to do this by a O(N^4) method.
I would like to use a faster algorithm available as
public domain source. Pointers appreciated. Thanks.

Relevant Pages