[vtkusers] Minimum distance between two vtkPolyData objects?

[Bill Lorensen]

I agree. You should try to find an open source implementation.



On Thu, Apr 11, 2013 at 9:14 PM, jozzas <jozzas at hotmail.com> wrote:

> Hey Bill,
>
> My understanding is that vtkDistancePolyDataFilter computes the distance at
> every point (vertex) in each vtkPolyData object passed to it.
>
> If you imagine two narrow rectangular prisms, one rotated 90 degrees and
> slightly above the other in Z, you can see that this algorithm doesn't
> calculate the minimum distance between the convex sets defined by those
> vtkPolyData instances, as calculating vertex-vertex distances is
> inaccurate.
> The minimum distance between these objects intersects the faces which
> overlap in XY, so any algorithm to determine the true minimum distance
> (like
> GJK) will include edges, faces and vertices.
>
>
>
> --
> View this message in context:
> http://vtk.1045678.n5.nabble.com/Minimum-distance-between-two-vtkPolyData-objects-tp5719993p5719995.html
> Sent from the VTK - Users mailing list archive at Nabble.com.
> _______________________________________________
> Powered by www.kitware.com
>
> Visit other Kitware open-source projects at
> http://www.kitware.com/opensource/opensource.html
>
> Please keep messages on-topic and check the VTK FAQ at:
> http://www.vtk.org/Wiki/VTK_FAQ
>
> Follow this link to subscribe/unsubscribe:
> http://www.vtk.org/mailman/listinfo/vtkusers
>



-- 
Unpaid intern in BillsBasement at noware dot com
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.vtk.org/pipermail/vtkusers/attachments/20130411/6fd2cc1c/attachment.htm>