Efficient generation of object hierarchies from 3D scenes

Describes an efficient technique for computing a hierarchical representation of the objects contained in a complex 3D scene. First, an adjacency graph keeping the costs of grouping the different pairs of objects in the scene is built. Then the minimum spanning tree (MST) of that graph is determined. A binary clustering tree (BCT) is obtained from the MST. Finally, a merging stage joins the adjacent nodes in the BCT which have similar costs. The final result is an n-ary tree which defines an intuitive clustering of the objects of the scene at different levels of abstraction. Experimental results with synthetic 3D scenes are presented.

[1]  Stephen Cameron.  Efficient bounds in constructive solid geometry , 1991, IEEE Computer Graphics and Applications.

[2]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[3]  Angel P. del Pobil,et al.  Very fast collision detection for practical motion planning. I. The spatial representation , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[4]  Roy Featherstone,et al.  Automatic generation of sphere hierarchies from CAD data , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[5]  P.G. Xavier.  A generic algorithm for constructing hierarchical representations of geometric objects , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[6]  Kenneth H. Rosen.  Discrete mathematics and its applications , 1984 .

[7]  Sean Quinlan,et al.  Efficient distance computation between non-convex objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.