An Efficient Representation of Quadtrees and Bintrees for Multiresolution Terrain Models  

An Efficient Representation of Quadtrees and Bintrees for Multiresolution Terrain Models

在线阅读下载全文

作  者:Yusnier Valle José Ortiz 

机构地区:[1]Center of Geoinformatics and Digital Signals,University of Informatics Sciences [2]Dean of the Faculty 1,University of Informatics Sciences

出  处:《Geo-Spatial Information Science》2011年第3期198-206,共9页地球空间信息科学学报(英文)

基  金:Supported by the GeneSIG Project, University of Informatics Sciences (UCI), Havana, Cuba

摘  要: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 Ele-vation 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 multiresolu-tion surfaces.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 Ele- vation 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 multiresolu- tion surfaces.

关 键 词:bintrees QUADTREES space-filling curves spatial data structures digital terrain models 

分 类 号:TP311.12[自动化与计算机技术—计算机软件与理论]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象