AN EFFICIENT QUADTREE DATASTRUCTURE FOR NEIGHBOR FINDING ALGORITHM-Reference-Cited by-同舟云学术

AN EFFICIENT QUADTREE DATASTRUCTURE FOR NEIGHBOR FINDING ALGORITHM

Published:2001-10 Issue:04 Volume:01 Page:619-633
ISSN:0219-4678
Container-title:International Journal of Image and Graphics
language:en
Short-container-title:Int. J. Image Grap.

Author:

KUMAR B. PRAVEEN¹,GUPTA PHALGUNI¹,HWANG C. J.²

Affiliation:

1. Department of Computer Science & Engineering, Indian Institute of Technology, Kanpur - 208016, India

2. Department of Computer Science, Southwest Texas State University, Texas - 78666 4616, USA

Abstract

In this paper, we have studied the problem of finding the neighbors of a node in a quadtree. We have proposed a variation in the quadtree representation which has helped in finding the neighbors efficiently. We have presented algorithms for construction and maintenance of our quadtree.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Graphics and Computer-Aided Design,Computer Science Applications,Computer Vision and Pattern Recognition

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0219467801000426

Reference7 articles.

1. The Quadtree and Related Hierarchical Data Structures

2. Computing Perimeters of Regions in Images Represented by Quadtrees

3. Connected Component Labeling Using Quadtrees

4. Distance Transform for Images Represented by Quadtrees

5. Neighbor finding techniques for images represented by quadtrees

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A novel SLC to GEO image generation approach and automatic control points conversion from GEO to SLC domain for SAR data quality evaluation and analysis;Geocarto International;2022-08-24

2. High‐performance implementation of a two‐bit geohash coding technique for nearest neighbor search;Concurrency and Computation: Practice and Experience;2020-10-05