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 im...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.展开更多
We propose a novel binary image representation algorithm using the non-symmetry and anti-packing model and the coordinate encoding procedure （NAMCEP）. By tak- ing some idiomatic standard binary images in the field o...We propose a novel binary image representation algorithm using the non-symmetry and anti-packing model and the coordinate encoding procedure （NAMCEP）. By tak- ing some idiomatic standard binary images in the field of image processing as typical test objects, and by comparing our proposed NAMCEP representation with linear quadtree （LQT）, binary tree （Bintree）, non-symmetry and anti-packing model （NAM） with K-lines （NAMK）, and NAM representa- tions, we show that NAMCEP can not only reduce the aver- age node, but also simultaneously improve the average com- pression. We also present a novel NAMCEP-based algorithm for area calculation and show experimentally that our algo- rithm offers significant improvements.展开更多
基金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.
基金We thank the anonymous reviewers and editors for their valuable comments on improving this paper. This work was supported by the National Natural Science Foundation of China （Grant No. 61300134）, the Research Fund for the Doctoral Program of Higher Education of China （20120172120036）, the Natural Science Foundation of Guangdong Province of China （S2011040005815 and S2013010012515）, the Foundation for Dis- tinguished Young Talents in Higher Education of Guangdong of China （LYM11015）, and the Fundamental Research Funds for the Central Universities of China （2011ZM0074 and 2013ZZ0050）.
文摘We propose a novel binary image representation algorithm using the non-symmetry and anti-packing model and the coordinate encoding procedure （NAMCEP）. By tak- ing some idiomatic standard binary images in the field of image processing as typical test objects, and by comparing our proposed NAMCEP representation with linear quadtree （LQT）, binary tree （Bintree）, non-symmetry and anti-packing model （NAM） with K-lines （NAMK）, and NAM representa- tions, we show that NAMCEP can not only reduce the aver- age node, but also simultaneously improve the average com- pression. We also present a novel NAMCEP-based algorithm for area calculation and show experimentally that our algo- rithm offers significant improvements.
