[sci.math] Triangularization

garry@ithaca.uucp (Garry Wiegand) (04/24/91)

I am looking for references on the subject of transforming an
arbitrary polyhedron or polyhedral mesh into a "nice" 6-connected
triangular mesh, by introducing a minimal number (or near-minimal)
number of extra (redundant) edges and vertices and perhaps a
zero-width hole or two. 

The construct, if I had it, I think would lend itself to some
pleasant graphics rendering optimizations.

It seems like work must already have been done on this subject,
among the triangle-strip people or the finite-element people, or
even the mathematicians, but so far I'm totally spinning my wheels
in the library trying to find it. Help would be appreciated - a
recent reference or two to get me started on the right track is all
I need.
 
(If there's related code on-line somewhere, far be it from me to
turn that down either.) 

Thanks. Followups to comp.graphics.

Garry Wiegand --- Ithaca Software, Alameda, California
...!uunet!ithaca!garry, 415 523-5900 x219