Prism Trees: A Hierarchical Representation for 3-D Objects
暂无分享,去创建一个
In this paper we propose a new hierarchical structure for describing 5-0 objects, called the Prism Tree. This ternar tree structure, inspired from the planar Strip Tree, is built from an initial trianguiation of the object by using a polyhedral approximation algorithm. Different properties of this representation are shown, as well as algorithms for intersecting objects and neighbor finding techniques.
[1] Dana H. Ballard,et al. Strip trees: a hierarchical representation for curves , 1981, CACM.
[2] Hanan Samet,et al. Neighbor finding techniques for images represented by quadtrees , 1982, Comput. Graph. Image Process..
[3] Theodosios Pavlidis,et al. A hierarchical data structure for picture processing , 1975 .
[4] Olivier D. Faugeras,et al. Polyhedral approximation of 3-D objects without holes , 1984, Comput. Vis. Graph. Image Process..