Path: utzoo!utgpu!news-server.csri.toronto.edu!rutgers!cs.utexas.edu!tut.cis.ohio-state.edu!usenet.ins.cwru.edu!ncoast!atul
From: atul@NCoast.ORG (Atul Parulekar)
Newsgroups: comp.graphics
Subject: triangulation and contouring
Message-ID: <1990Aug15.003127.22609@NCoast.ORG>
Date: 15 Aug 90 00:31:27 GMT
Organization: North Coast Public Access *NIX, Cleveland, OH
Lines: 13

I think there was a discussion some time back about delaunay triangulation of
random points.  I wrote a program to do this based on a paper by Cavendish JC,
Field DA, Frey WH in the International Journal for Numerical Methods in 
Engineering, V21, 1985, but it ran too slowly (I have seen programs which run
5-10 times faster).  Is there any fast (fastest ?) algorithm to do this?

Also, I would like to include breaklines in the data.  (These are lines which
cannot be intersected by any triangle, i.e., the lines are a part of the
triangulation.)  Any suggestions?

Finally, any suggestions on how this triangle network can be used for 
contouring directly (i.e., without first generating a grid of regularly
spaced points)?