3-D Triangulation grid shape definition

Question

I am looking for any algorithm or source code that can find whole or partial simple three-dimensional shapes (sphere, cylinder, cone, etc.) in a three-dimensional triangulation grid.

I found several works on algorithms (for example, see this PDF ) that can find shapes in point clouds. Triangulation can easily be converted to a point cloud, but it seems to me that it is easier to find shapes if you already have triangulation, since you have more information about the surface that needs to be matched - the connection is lost, for example, in conversion to a point cloud.

Any pointers would be appreciated.

Answer 1

The “Princeton Shape Recovery and Analysis Team” are the gurus in the field. You can track feild using your publications.