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?

-- 
#macro M(A,N,D,L)plane{-z,-9pigment{mandel L*9translate N color_map{[0rgb x]
[1rgb 9]}scale<D,D*3D>*1e3}rotate y*A*8}#end M(-3<1.206434.28623>70,7)M(
-1<.7438.1795>1,20)M(1<.77595.13699>30,20)M(3<.75923.07145>80,99)// - Warp -

Post a reply to this message

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

Thorsten Froehlich wrote:

> 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/>.

Additionally, CGAL (http://www.cgal.org/) provides a modern C++
implementation. A research licence is available free of charge. 

Thomas

-- 
aaa := ira

Post a reply to this message