作者: Anita G. Pai , H. Usha , Arun K. Pujari
DOI: 10.1016/0167-8655(90)90014-S
关键词:
摘要: Abstract The paper describes a new algorithm for constructing linear octree of 3D object from the binary silhouettes in three orthogonal views. basic paradigm is derived segment tree structrue. However, efficient implementation we make use modified structure, named here inverted and show that complexity O( N log 2 ) , where size any 2D silhouette × pixels. This gives result.