The design and analysis of spatial data structures
The design and analysis of spatial data structures
An effective way to represent quadtrees
Communications of the ACM
Quadtree-based representations of grid-oriented data
Image and Vision Computing
All-nearest-neighbors finding based on the Hilbert curve
Expert Systems with Applications: An International Journal
Micro air vehicle path planning in fuzzy quadtree framework
Applied Soft Computing
Algebraic topological analysis of time-sequence of digital images
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
| Hi-index | 0.10 |
The paper presents an effective strategy for repetitive neighbor finding in binary images which is proper for mobile robot path planning, connected component labeling, etc. It is based on a new neighbor finding method which is universal and generates all the possible and arbitrary sized neighbors (larger, smaller, equal) for any quadtree node using simple algebraic operations.