DocumentCode :
1121476
Title :
On Encoding Boundaries with Quadtrees
Author :
Samet, Hanan ; Webber, Robert E.
Author_Institution :
Department of Computer Science and the Center for Automation Research, University of Maryland, College Park, MD 20742.
Issue :
3
fYear :
1984
fDate :
5/1/1984 12:00:00 AM
Firstpage :
365
Lastpage :
369
Abstract :
The ``line quadtree´´ data structure hierarchically represents a region and its boundary. Based on the standard quadtree, each node in this structure stores adjacency information as well. While line quadtrees use the same amount of space as standard qaudtrees, they facilitate several region processing algorithms. In particular, we describe efficient algorithms for boundary and superimposing two maps encoded as line quadtrees.
Keywords :
Automation; Computer science; Data mining; Data structures; Encoding; Geographic Information Systems; Image coding; Image processing; Image representation; Strips; Boundary following; boundary representation; hierarchical data structures; image representation; map superimposition; polygonal maps; quadtrees;
fLanguage :
English
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher :
ieee
ISSN :
0162-8828
Type :
jour
DOI :
10.1109/TPAMI.1984.4767529
Filename :
4767529
Link To Document :
بازگشت