constrained (Delaunay) triangulation

[Seth Teller]

has anyone implemented constrained triangulation in 2-D?  i have
a point set and some collection of non-intersecting edges over 
the set.  i want a triangulation over the set that includes the
edges i specify beforehand.  furthermore, i want to compute this
thing in O(n lg n) time and space.

there is an extension of steve fortune's algorithm that does
this, but as far as i know it has not been implemented.  does
anyone have or know of code to do this?  i'd rather not waste
a week hacking on a done problem.

thanks,

seth

ps: comp.graphics people please email, don't post-- thanks again.