santhosh2708

03-07-2003, 07:26 PM

Hi,

I have a set of 2D points which have to be triangulated.

Can you suggest me a faster 2D Delaunay triangulation code in C or C++.

I tried 2 of the available ones.

One from RMIT

Author: Geoff Leach, Department of Computer Science, RMIT.

email: gl@cs.rmit.edu.au

When 2D points are linear, triangulation is skewed.

Its not a convex hull anymore.

The other is from INRIA

Author: Oliver Devillers, SOP, INRIA

ftp://ftp-sop.inria.fr/prisme/del-hierarchy

This does not give triangles, but edges only from a set of 2D points

I tried to extract triangles. Sometimes, I find holes i.e. lose a few

triangles.

It took about 113 mSecs for 3600 vertices.

Please suggest a tried out code for 2D delaunay triangulation for

a set of vertices.

regards

--

Santhosh

[please cc to santhosh@gdit.iiit.net ]

I have a set of 2D points which have to be triangulated.

Can you suggest me a faster 2D Delaunay triangulation code in C or C++.

I tried 2 of the available ones.

One from RMIT

Author: Geoff Leach, Department of Computer Science, RMIT.

email: gl@cs.rmit.edu.au

When 2D points are linear, triangulation is skewed.

Its not a convex hull anymore.

The other is from INRIA

Author: Oliver Devillers, SOP, INRIA

ftp://ftp-sop.inria.fr/prisme/del-hierarchy

This does not give triangles, but edges only from a set of 2D points

I tried to extract triangles. Sometimes, I find holes i.e. lose a few

triangles.

It took about 113 mSecs for 3600 vertices.

Please suggest a tried out code for 2D delaunay triangulation for

a set of vertices.

regards

--

Santhosh

[please cc to santhosh@gdit.iiit.net ]