The quadcode and its arithmetic
Communications of the ACM
An effective way to represent quadtrees
Communications of the ACM
The quadcode and its arithmetic
Communications of the ACM
A CAD system for the capture of combat casualty care information
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Non-interleaved quadtree node codification
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
SPREAD: sound propagation and perception for autonomous agents in dynamic environments
Proceedings of the 12th ACM SIGGRAPH/Eurographics Symposium on Computer Animation
| Hi-index | 48.23 |
A method is presented for determining whether two given regions are adjacent, and for finding all the neighbors of different sizes for a given region. Regions are defined as elementary squares of any size. In a companion paper [2], we introduce the quadcode and discuss its use in representing geometric concepts in the coded image, such as location, distance, and adjacency. In this paper we give a further discussion of adjacency in terms of quadcodes. Gargantini [1] discussed adjacency detection using linear quadtrees. Her discussion was applied to pixels, and a procedure was given to find a pixel's southern neighbor only. This paper considers elementary squares of any size, and gives procedures for both aspects of the problem: for determining whether two given regions are adjacent, and for finding all the neighbors of different sizes for a given region.