[vtk-developers] Delaunay2D infinite recursion

[Will Schroeder]

David-

One of these days we are going to have to fix the Delaunay classes properly.
For such a beautiful algorithm it suffers from insidious numerical issues.
Either discretize space or use some sort of infinite / higher precision.....

I'll take a look, it'll likely be this weekend at the earliest.

Will

On Wed, Feb 10, 2010 at 11:41 PM, David Gobbi <david.gobbi at gmail.com> wrote:

> Hi All,
>
> I've written a clipping filter that uses constrained Delaunay to
> triangulate the contours that result from the clipping.  The
> vtkPolygon can triangulate these contours by ear-cut with no
> difficulty at all, but vtkDelaunay gives me lots of warnings (Edge not
> recovered, polygon fill suspect) and often crashes.  These contours of
> mine have no interior points and about 10 unevenly-spaced points on
> the perimeter.
>
> Below is one of the data sets that causes Delaunay2D to crash on my
> Linux64 gcc-4.2 system.  Specifically,  FindTriangle() goes into
> infinite recursion.  Can anyone confirm this?  I've also written a
> python program that displays the problem data and runs delaunay on the
> data.
>
>   David
>
> _______________________________________________
> Powered by www.kitware.com
>
> Visit other Kitware open-source projects at
> http://www.kitware.com/opensource/opensource.html
>
> Follow this link to subscribe/unsubscribe:
> http://www.vtk.org/mailman/listinfo/vtk-developers
>
>
>


-- 
William J. Schroeder, PhD
Kitware, Inc.
28 Corporate Drive
Clifton Park, NY 12065
will.schroeder at kitware.com
http://www.kitware.com
(518) 881-4902
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://public.kitware.com/pipermail/vtk-developers/attachments/20100211/f0f7504b/attachment.html>