[vtkusers] Outer polygon of an arbitrary point cloud

[Paulo Bernardes]

Thank you for the e-mail!

 

I've already tried the Delaunay triangulation, but, as you say, the problem
is it only returns a convex hull. :-)

 

Many thanks,

 

Paulo

 

 

  _____  

De: Meisam Aliroteh [mailto:meisam.aliroteh at gmail.com] 
Enviada: quarta-feira, 19 de Setembro de 2007 3:42
Para: Paulo Bernardes
Cc: vtkusers at vtk.org
Assunto: Re: [vtkusers] Outer polygon of an arbitrary point cloud

 

You can use Delaunay triangulation (vtkDelaunay2D or vtkDelaunay3D). But
keep in mind that this algorithm only returns the convex hull of a point
cloud. I just remembered that there is also another algorithm called Quick
Hull (google search for QHull). This algorithm also returns a convex hull.
I'm not sure if there is an algorithm that can actually handle both convex
and concave hulls (as far as I know getting a concave hull is a much more
difficult task than a convex hull). 

On 9/18/07, Paulo Bernardes <pbernardes at uaum.uminho.pt> wrote: 

Dear all,

 

Is there any way to determine the outer polygon of an arbitrary point cloud
using VTK?

 

Many Thanks

 

Paulo

 


_______________________________________________
This is the private VTK discussion list. 
Please keep messages on-topic. Check the FAQ at:
http://www.vtk.org/Wiki/VTK_FAQ
Follow this link to subscribe/unsubscribe: 
http://www.vtk.org/mailman/listinfo/vtkusers

 



-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.vtk.org/pipermail/vtkusers/attachments/20070919/d5c52f0c/attachment.htm>