Abstract
Abstract One motivation for the need of maps to be organized hierarchically in different resolutions is the fact that in most applications low-resolution maps require less heavy computations than maps represented at higher resolutions. Spatial data structures that permit generation of lower levels or resolution in a hierarchical fashion already exist, e.g., quad-trees and resolution pyramids. Many other spatial data structures that are non-hierarchical, and therefore do not permit the generation of resolution hierarchies, also exist. One such structure is the run-length-code (RLC), which has many powerful advantages that make the structure feasible in geographical information systems. In this article an approach to the problem of generating a resolution hierarchy from RLC is described and discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Geographical Information Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
