2009/4/29 Michaël Michaud <michael.mich...@free.fr>
> Hi Martin,
>
> You may already know the benchmark done by Erwan's team with some java
> implementations (
> http://conference.osgeo.org/index.php/foss4g/2008/paper/view/282/177)
> It eventually shows the triangulator I have written a few years ago
> (available on http://geo.michaelm.free.fr/OpenJUMP/resources/) is very
> fast (I have to add it is not 100% robust as it sometimes fails for large
> datasets - more than 100k points)
> They also wrote a more recent paper about their new implementation for
> orbisgis :
> http://hal.archives-ouvertes.fr/docs/00/32/95/03/PDF/CDT-paper.pdf
>
good evening,
Indeed, in 2008, several (C)DT implementations (including famous "Triangle"
implementation) have been coupled with OrbisGIS so as to compare
performances. It seems the one of Michaël (thanks to him for his useful
help) was the fastest one. I've also tried to "enhance" his own
implementation adding a sweepline and a (not fully debug yet - job was
postponed) soft breakline insertion method. All those dev will be published
asap.
--
Thomas LEDUC
------------------------------------------------------------------------------
Register Now & Save for Velocity, the Web Performance & Operations
Conference from O'Reilly Media. Velocity features a full day of
expert-led, hands-on workshops and two days of sessions from industry
leaders in dedicated Performance & Operations tracks. Use code vel09scf
and Save an extra 15% before 5/3. http://p.sf.net/sfu/velocityconf
_______________________________________________
Jump-pilot-devel mailing list
Jump-pilot-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/jump-pilot-devel
