Nearest Neighborhood for PolygonMesh

classic Classic list List threaded Threaded
4 messages Options
Reply | Threaded
Open this post in threaded view
|

Nearest Neighborhood for PolygonMesh

dkanoulas
Hi all,

I have a PolygonMesh, created using OrganizedFastMesh (with kdtree as search method).  Given the mesh and a point p (index to my point cloud from which the mesh has been constructed), I would like to answer (efficient wrt time) to the query: "Find all the triangles that have p as vertex", without of course having to iterate through my whole list of the triangles and checking the indices.  Is there such a method implemented in PCL for PolygonMesh or any idea?  I haven't seen such a method in the API, but just to make sure.

Thanks a lot!
"And now, what's going to happen to us without barbarians?
They were, those people, a kind of solution." -- C. Cavafy
Reply | Threaded
Open this post in threaded view
|

Re: Nearest Neighborhood for PolygonMesh

Martin
Hi,

please have a look at my blog (which has not been updated since ages...)
http://www.pointclouds.org/blog/nvcs/martin/index.php

The operation you want is implemented in getFaceAroundVertexConstCirculator. See pcl-trunk/examples/geometry/example_half_edge_mesh.cpp for an example.

Please note that the mesh is still under development and the API is not stable yet. I also found compatibility issues with the rest of PCL (you can't simply run an algorithm that works with a PointCloud on the mesh).

I have currently not so much time to work on PCL but this should improve in a few weeks.

best regards
Martin
Reply | Threaded
Open this post in threaded view
|

Re: Nearest Neighborhood for PolygonMesh

Radu B. Rusu
Administrator
In reply to this post by dkanoulas
Unfortunately there is a feature request for this to be implemented on http://dev.pointclouds.org 
(http://dev.pointclouds.org/issues/735) but no developers have been volunteering to implement it.

Cheers,
Radu.
--
http://openperception.org

On 11/13/2012 08:29 AM, dkanoulas wrote:

> Hi all,
>
> I have a PolygonMesh, created using OrganizedFastMesh (with kdtree as search
> method).  Given the mesh and a point p (index to my point cloud from which
> the mesh has been constructed), I would like to answer (efficient wrt time)
> to the query: "Find all the triangles that have p as vertex", without of
> course having to iterate through my whole list of the triangles and checking
> the indices.  Is there such a method implemented in PCL for PolygonMesh or
> any idea?  I haven't seen such a method in the API, but just to make sure.
>
> Thanks a lot!
>
>
>
> -----
> "And now, what's going to happen to us without barbarians?
> They were, those people, a kind of solution." -- C. Cavafy
> --
> View this message in context: http://www.pcl-users.org/Nearest-Neighborhood-for-PolygonMesh-tp4023744.html
> Sent from the Point Cloud Library (PCL) Users mailing list mailing list archive at Nabble.com.
> _______________________________________________
> [hidden email] / http://pointclouds.org
> http://pointclouds.org/mailman/listinfo/pcl-users
>
_______________________________________________
[hidden email] / http://pointclouds.org
http://pointclouds.org/mailman/listinfo/pcl-users
Reply | Threaded
Open this post in threaded view
|

Re: Nearest Neighborhood for PolygonMesh

daftendireckt
Hi

Has it been implemented yet?
The link to the feature request doesn't work anymore and I'm also trying to
retrieve all the faces containing a given point in an efficient way...

Thanks!



--
Sent from: http://www.pcl-users.org/
_______________________________________________
[hidden email] / http://pointclouds.org
http://pointclouds.org/mailman/listinfo/pcl-users