Strategy for repetitive neighbor finding in octree representations

Image and Vision Computing

Volumn 18, Issue 14, 2000, Pages 1085-1091

  Voros J ^a  

^a SLOVAK UNIVERSITY OF TECHNOLOGY   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; IMAGE ANALYSIS; IMAGE CODING; IMAGE QUALITY; MATRIX ALGEBRA; TREES (MATHEMATICS);

OCTREE REPRESENTATIONS; REPETITIVE NEIGHBOR FINDING;

COMPUTER VISION;

EID: 0034324391     PISSN: 02628856     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0262-8856(00)00049-4     Document Type: Article

References (8)

1. Jackins C.L., Tanimoto S.L. Oct-trees and their use in representing three-dimensional objects. Computer Graphics and Image Processing. 14:1980;249-270.
2. Meagher D. Geometric modeling using octree encoding. Computer Graphics and Image Processing. 19:1982;129-147.
3. Samet H. The Design and Analysis of Spatial Data Structures. 1990;Addison Wesley, Reading, MA.
4. Samet H. Neighbor finding in images represented by octrees. Computer Vision, Graphics, and Image Processing. 46:1989;367-386.
5. Gargantini I. Linear oct-trees for fast processing of three-dimensional objects. Computer Graphics and Image Processing. 20:1982;365-374.
6. J. Vörös, Approximate quadtree and octree representations for manufacturing tasks, Preprints 3rd IFAC Symposium on Low Cost Automation, Vienna, 1992, pp. 391-396.
7. J. Vörös, Trajectory planning in 3D workspaces represented by octrees, Preprints IFAC Workshop on Manufacturing Systems: Modelling, Management and Control, Vienna, 1997, pp. 331-336.
8. Vörös J. strategy for repetitive neighbor finding in images represented by quadtrees. Pattern Recognition Letters. 18:1997;955-962.