Linear octrees by volume intersection

dc.contributor.author	Pujari, Lavakusha Arun K.
dc.contributor.author	Reddy, P. G.
dc.date.accessioned	2022-03-27T05:51:51Z
dc.date.available	2022-03-27T05:51:51Z
dc.date.issued	1989-01-01
dc.description.abstract	The paper describes a new algorithm for constructing a 3D approximation of an object from three orthogonal 2D silhouettes. The 2D views are represented as binary arrays and 3D approximation is obtained as a linear octree. The algorithm makes use of volume intersection of three cylinders obtained by sweeping three views in respective directions. The algorithm takes less time than an existing algorithm which makes use of three quadtrees and an octree for 2D and 3D image representation, respectively. Unlike the previous algorithm, the present algorithm does not require any preprocessing stage or condensation. It is Shown that the proposed algorithm is of o(T), where T is the total number of nodes in the resulting octree. © 1989.
dc.identifier.citation	Computer Vision, Graphics and Image Processing. v.45(3)
dc.identifier.issn	0734189X
dc.identifier.uri	10.1016/0734-189X(89)90089-3
dc.identifier.uri	https://www.sciencedirect.com/science/article/abs/pii/0734189X89900893
dc.identifier.uri	https://dspace.uohyd.ac.in/handle/1/8451
dc.title	Linear octrees by volume intersection
dc.type	Journal. Article
dspace.entity.type

Now showing 1 - 1 of 1