Path: news.mathworks.com!not-for-mail
From: "Luigi Giaccari" <giaccariluigi@msn.com>
Newsgroups: comp.soft-sys.matlab
Subject: Delaunay
Date: Thu, 14 May 2009 13:08:01 +0000 (UTC)
Organization: L'aquila
Lines: 11
Message-ID: <guh53h$22b$1@fred.mathworks.com>
Reply-To: "Luigi Giaccari" <giaccariluigi@msn.com>
NNTP-Posting-Host: webapp-05-blr.mathworks.com
Content-Type: text/plain; charset="ISO-8859-1"
Content-Transfer-Encoding: 8bit
X-Trace: fred.mathworks.com 1242306481 2123 172.30.248.35 (14 May 2009 13:08:01 GMT)
X-Complaints-To: news@mathworks.com
NNTP-Posting-Date: Thu, 14 May 2009 13:08:01 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 1548775
Xref: news.mathworks.com comp.soft-sys.matlab:539887


Hi I was testing the new delaunay triangulator from the CGAL library available from R2009a.

These are my results: 
The new one is faster than delaunayn of 3-4 factors on uniform dataset.
Instead, for sparse dataset is terribly slower, for a medium number of points I had to stop the test before it finished.

Test were run on 2-D 3-D models with increasing number of points up to 1e5.

Have you some explanation on that? and what is your opinon?

Thanks in advance