In article <3f491f0f@news.povray.org> , Warp <war### [at] tagpovrayorg>  wrote:

> Thorsten Froehlich <tho### [at] trfde> wrote:
>> Delaunay triangulation takes O(n log n) time if I recall correctly.
>
>   Sounds reasonable.
>   How well does it work?

The result "looks good" in those cases that are shown everywhere it is used
- if that is what you are asking.  Sample code implementing it can be found
at <http://www1.acm.org/pubs/tog/GraphicsGems/gemsiv/delaunay/>.

    Thorsten

____________________________________________________
Thorsten Froehlich, Duisburg, Germany
e-mail: tho### [at] trfde

Visit POV-Ray on the web: http://mac.povray.org

Post a reply to this message