2001•International Journal of Image and GraphicsRequires access
AN EFFICIENT QUADTREE DATASTRUCTURE FOR NEIGHBOR FINDING ALGORITHM
B. PRAVEEN KUMAR, Phalguni Gupta, C. Jinshong Hwang
Open publisher page 3 citations
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.