A strategy for repetitive neighbor finding in images represented by quadtrees

Pattern Recognition Letters

Volumn 18, Issue 10, 1997, Pages 955-962

  Vörös, Jozef ^a,b  

^a SLOVAK UNIVERSITY OF TECHNOLOGY   (Slovakia)

^b NONE   (Slovakia)

Author keywords

Neighbor finding; Quadtrees

Indexed keywords

DATA STRUCTURES; MOBILE ROBOTS; MOTION PLANNING;

REPETITIVE NEIGHBOR FINDING METHOD;

OBJECT RECOGNITION;

EID: 0031249589     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(97)80001-3     Document Type: Article

References (5)

1. Gargantini, I., 1982. An effective way to represent quadtrees. Comm. ACM 25 (12), 905-910.
2. Samet, H., 1982. Neighbor finding techniques for images represented by quadtrees. Comput. Graphics Image Process. 18, 37-57.
3. Samet, H., 1990. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA.
4. Vörös, J., 1994. Top-down generation of quadtree representation using color-change-code. Computers and Artificial Intelligence 13 (10), 91-103.
5. Vörös, J., 1997. Trajectory planning in 3D workspaces represented by octrees. Preprints IFAC Workshop on Manufacturing Systems: Modelling, Management and Control, Wien, pp. 331-336.