Abstract
A space-filling curve in 2, 3, or higher dimensions can be thought as a path of a continuously moving point. As its main goal is to preserve spatial proximity, this type of curves has been widely used in the design and implementation of spatial data structures and nearest neighbor-finding techniques. This paper is essentially focused on the efficient representation of Digital Elevation Models (DEM) that entirely fit into the main memory. We propose a new hierarchical quadtree-like data structure to be built over domains of unrestricted size, and a representation of a quadtree and a binary triangles tree by means of the Hilbert and the Sierpinski space-filling curves, respectively, taking into account the hierarchical nature and the clustering properties of this kind of curves. Some triangulation schemes are described for the space-filling-curves-based approaches to efficiently visualize multiresolution surfaces.
Published Version (
Free)
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 callDisclaimer: 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.
