An Efficient Representation of Quadtrees and Bintrees for Multiresolution Terrain Models

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.

L curve for spherical triangle region quadtrees

The sequence of facets and nodes has a direct influence on the efficiency of access to spherical triangle region quadtree. Based on the labeling schema by Lee, spatial curves both for facets and nodes are proposed and the main algorithms for coordinate translation, node Lsequence generation and visiting nodes are presented. In particular,constant time algorithms for generating node Lsequence are advanced by using bit manipulation operations,which can be easily implemented with hardware. In L curve the distance between three nodes of a facet is mostly limited in a range of small value, thus making fast access possible. Though codes of sibling facets are continuous, the difference between codes of some cousins may occasionally be very large and makes the distance of a few facets also very large, thus greatly increasing the mean node distance and the total traversing distance. Therefore an m cluster of nodes is proposed as a basic storage unit fo n cluster, which should store eery shared node in each,and the distance between three nodes of a facet is limited to a controllagle scope.

Efficient Quadtree based Fractal Image Coding Scheme in Wavelet Transform Domain *

This paper presents an efficient quadtree based fractal image coding scheme in wavelet transform domain based on the wavelet based theory of fractal image compression introduced by Davis. In the scheme, zerotrees of wavelet coefficients are used to reduce the number of domain blocks, which leads to lower bit cost required to represent the location information of fractal coding, and overall entropy constrained optimization is performed for the decision trees as well as for the sets of scalar quantizers and self quantizers of wavelet subtrees. Experiment results show that at the low bit rates, the proposed scheme gives about 1 dB improvement in PSNR over the reported results.

Numerical simulation of wind-driven circulation and pollutant transport in Taihu Lake based on a quadtree grid

In this study,a two-dimensional flow-pollutant coupled model was developed based on a quadtree grid.This model was established to allow the accurate simulation of wind-driven flow in a large-scale shallow lake with irregular natural boundaries when focusing on important smallscale localized flow features.The quadtree grid was created by domain decomposition.The governing equations were solved using the finite volume method,and the normal fluxes of mass,momentum,and pollutants across the interface between cells were computed by means of a Godunov-type Osher scheme.The model was employed to simulate wind-driven flow in a circular basin with non-uniform depth.The computed values were in agreement with analytical data.The results indicate that the quadtree grid has fine local resolution and high efficiency,and is convenient for local refinement.It is clear that the quadtree grid model is effective when applied to complex flow domains.Finally,the model was used to calculate the flow field and concentration field of Taihu Lake,demonstrating its ability to predict the flow and concentration fields in an actual water area with complex geometry.

Differentially Private Spatial Decompositions for Geospatial Point Data

Technological advancements in data analysis and data releasing have put forward higher security requirements, such as privacy guarantee and strictly provable security, this new area of research is called differential privacy. As for geospatial point data, the exiting methods use the tree structure to split the data space to enhance the data utility and usually adopt uniform budgeting method. Different from this, we propose a novel non-uniform allocation scheme for privacy budget which is a parameter to specify the degree of privacy guarantee. Firstly, the spatial data is indexed by quadtree, then, different privacy budget is allocated to each layer of quadtree using Fibonacci series features, and we designate this budgeting method as Fibonacci allocation. Experimental results show that Fibonacci allocation is significantly more accurate in data queries than the state-of-the-art methods under the same privacy guarantee level and fits for arbitrary range queries. Furthermore, data utility can be improved by post-processing and threshold determination.

HQ-Tree： A Distributed Spatial Index Based on Hadoop

In this paper,we propose a novel spatial data index based on Hadoop:HQ-Tree.In HQ-Tree,we use PR QuadTrec to solve the problem of poor efficiency in parallel processing,which is caused by data insertion order and space overlapping.For the problem that HDFS cannot support random write,we propose an updating mechanism,called "Copy Write",to support the index update.Additionally,HQ-Tree employs a two-level index caching mechanism to reduce the cost of network transferring and I/O operations.Finally,we develop MapReduce-based algorithms,which are able to significantly enhance the efficiency of index creation and query.Experimental results demonstrate the effectiveness of our methods.

A two-dimensional numerical wave flume based on SA-MPLS method

A spatially adaptive (SA) two-dimensional (2-D) numerical wave flume is presented based on the quadtree mesh system,in which a new multiple particle level set (MPLS) method is proposed to solve the problem of interface tracking,in which common intersection may be traversed by multiple interfaces.By using the adaptive mesh technique and the MPLS method,mesh resolution is updated automatically with time according to flow characteristics in the modeling process with higher resolution around the free surface and the solid boundary and lower resolution in less important area.The model has good performance in saving computer memory and CPU time and is validated by computational examples of small amplitude wave,second-order Stokes wave and cnoidal wave.Computational results also indicate that standing wave and wave overtopping are also reasonably simulated by the model.

Contour representation based on wedgelet

Aiming at the shortcomings of the existing wedgelet compression arithmetics, a novel contour-representing algorithm based on wedgelets is presented in this paper. Firstly the input image is binarized and the most optimized wedgelets are found by means of quadtree framework. Then the contours are reconstructed by applying the wedgelets, the data volume is compressed, and the shortcomings of the contour representation based on normal wavelet are ameliorated, the better effect for the visualization is obtained, too.

Finite cell method compared to h-version finite element method for elasto-plastic problems

The finite cell method （FCM） combines the high-order finite element method （FEM） with the fictitious domain approach for the purpose of simple meshing. In the present study, the FCM is used to the Prandtl-Reuss flow theory of plasticity, and the results are compared with the h-version finite element method （h-FEM）. The numerical results show that the FCM is more efficient compared to the h-FEM for elasto-plastic problems, although the mesh does not conform to the boundary. It is also demonstrated that the FCM performs well for elasto-plastic loading and unloading.

Terrain Rendering LOD Algorithm Based on Improved Restrictive Quadtree Segmentation and Variation Coefficient of Elevation

Aiming to deal with the difficult issues of terrain data model simplification and crack disposal,the paper proposed an improved level of detail(LOD)terrain rendering algorithm,in which a variation coefficient of elevation is introduced to express the undulation of topography.Then the coefficient is used to construct a node evaluation function in the terrain data model simplification step.Furthermore,an edge reduction strategy is combined with the improved restrictive quadtree segmentation to handle the crack problem.The experiment results demonstrated that the proposed method can reduce the amount of rendering triangles and enhance the rendering speed on the premise of ensuring the rendering effect compared with a traditional LOD algorithm.

Framed-Quadtree Path Planning for an Underwater Vehicle with the Task of Tracking a Moving Target

An autonomous underwater vehicle (AUV) must use an algorithm to plan its path to distant, mobile offshore objects. Because of the uneven distribution of obstacles in the real world, the efficiency of the algorithm decreases if the global environment is represented by regular grids with all of them at the highest resolution. The framed quadtree data structure is able to more efficiently represent the environment. When planning the path, the dynamic object is expressed instead as several static objects which are used by the path planner to update the path. By taking account of the characteristics of the framed quadtree, objects can be projected on the frame nodes to increase the precision of the path. Analysis and simulations showed the proposed planner could increase efficiency while improving the ability of the AUV to follow an object.

Spatial Topology Rule Checking Algorithm of Linear Entity Based on Quadtree

Spatial topology rule is the primary method to insure the consistency and validity of spatial topology relation in GIS software. Topology rule can be divided into three categories according to geographic entity’s geometric shape: point topology rule, line topology rule and polygon topology rule. At first, this paper summarizes the various linear geographic entities’ topological relations which have practical application, then designs a series of linear entity topology rules detailedly. Based on these rules, this paper proposes a topology rule checking algorithm using quadtree, which is designed on the basis of MAPGIS7.4 spatial data model. The algorithm has already been applied to MAPGIS platform and gained good effects.

Image Coding Using Wavelet Transform and EntropyConstrained Vector Quantization with Quadtree Structure Vectors

This paper presents a new wavelet transform image coding method. On the basis of a hierarchical wavelet decomposition of images, entropy constrained vector quantization is employed to encode the wavelet coefficients at all the high frequency bands with

基于移动终端高效显示海量坐标对象的方法探讨

为了能在计算能力有限的移动设备上高效显示海量坐标对象,采用Quadtree作为数据结构,建立针对坐标对象集合的空间索引,并通过一个用于限制坐标对象规模的滑动可视区域-"视口",来从Quadtree中快速查找出需要动态显示的对象。通过对实现算法的分析表明,搜索目标对象的时间复杂度近似于O(log n),达到了所要实现的目标。

Personalized trajectory data perturbation algorithm based on quadtree indexing

To solve the privacy leakage problem of truck trajectories in intelligent logistics,this paper proposes a quadtreebased personalized joint location perturbation(QPJLP)algorithm using location generalization and local differential privacy(LDP)techniques.Firstly,a flexible position encoding mechanism based on the spatial quadtree indexing is designed,and the length of the encoding can be adjusted freely according to data availability.Secondly,to meet the privacy needs of different locations of users,location categories are introduced to classify locations as sensitive and ordinary locations.Finally,the truck invokes the corresponding mechanism in the QPJLP algorithm to locally perturb the code according to the location category,allowing the protection of non-sensitive locations to be reduced without weakening the protection of sensitive locations,thereby improving data availability.Simulation experiments demonstrate that the proposed algorithm effectively meets the personalized trajectory privacy requirements while also exhibiting good performance in trajectory proportion estimation and top-k classification.

Coupling of wave and current numerical model with unstructured quadtree grid for nearshore coastal waters

This paper presents 2D wave-current interaction model for evaluating nearly horizontal wave-induced currents in the surf-zone and coastal waters.The hydrodynamic model is the two-dimensional depth-averaged nonlinear shallow water equations by using an unstructured non-staggered and multiple-level quadtree rectangular mesh,this mesh information is stored in simple data structures and it is easy to obtain a locally high resolution for important region.The intercell fluxes are computed based on the HLL(Harten-Lax-van Leer) approximate Riemann solver with shock capturing capability for computing the dry-to-wet interface of coastal line.The effects of pressure and gravity are included in source term in the model,this treatment can simplify the computation and eliminate numerical imbalance between source and flux terms.The wave model readily provides the radiation stresses that represent the shortwave-averaged forces in a water column for the hydrodynamic model and the wave model takes into account the effect of wave-induced nearshore currents and water level.The coupling model is applied to verify different experimental cases and real life case of considering the wave-current interaction.The calculated results agree with analytical solution,experimental and field data.The results show that the modeling approach presented herein should be useful in simulating the nearshore processes in complicated natural coastal domains.

Loose architecture of multi-level massive geospatial data based on virtual quadtree

This paper proposed a virtual quadtree (VQT) based loose architecture of multi-level massive geospatial data for integrating massive geospatial data dispersed in the departments of different hierarchies in the same sector into a unified GIS (Geographic Information System) platform. By virtualizing the nodes of the quad-tree,the VQT separates the structure of data organization from data storage,and screens the difference between the data storage in local computer and in the re-mote computers in network environment. And by mounting,VQT easily integrates the data from the remote computers into the local VQT so as to implement seam-less integration of distributed multi-level massive geospatial data. Based on that mode,the paper built an application system with geospatial data over 1200 GB distributed in 12 servers deployed in 12 cities. The experiment showed that all data can be seamlessly rapidly traveled and performed zooming in and zooming out smoothly.

A NAM Representation Method for Data Compression of Binary Images

A representation method using the non-symmetry and anti-packing model （NAM） for data compression of binary images is presented. The NAM representation algorithm is compared with the popular linear quadtree and run length encoding algorithms. Theoretical and experimental results show that the algorithm has a higher compression ratio for both Iossy and Iossless cases of binary images and better reconstructed quality for the Iossy case.

Prior-Free Dependent Motion Segmentation Using Helmholtz-Hodge Decomposition Based Object-Motion Oriented Map

Motion segmentation in moving camera videos is a very challenging task because of the motion dependence between the camera and moving objects. Camera motion compensation is recognized as an effective approach. However, existing work depends on prior-knowledge on the camera motion and scene structure for model selection. This is not always available in practice. Moreover, the image plane motion suffers from depth variations, which leads to depth-dependent motion segmentation in 3D scenes. To solve these problems, this paper develops a prior-free dependent motion segmentation algorithm by introducing a modified Helmholtz-Hodge decomposition （HHD） based object-motion oriented map （OOM）. By decomposing the image motion （optical flow） into a curl-free and a divergence-free component, all kinds of camera-induced image motions can be represented by these two components in an invariant way. HHD identifies the camera-induced image motion as one segment irrespective of depth variations with the help of OOM. To segment object motions from the scene, we deploy a novel spatio-temporal constrained quadtree labeling. Extensive experimental results on benchmarks demonstrate that our method improves the performance of the state-of-the-art by 10%-20% even over challenging scenes with complex background.

Solution of N-S equations based on the quadtree cut cell method

With the characteristic of the quadtree data structure, a new mesh generation method, which adopts square meshes to decompose a background domain and a cut cell approach to express arbitrary boundaries, is proposed to keep the grids generated with a good orthogonality easily. The solution of N-S equations via finite volume method for this kind of unstructured meshes is derived. The mesh generator and N-S solver are implemented to study two benchmark cases, i.e. a lid driven flow within an inclined square and a natural convection heat transfer flow in a square duct with an inner hot circular face. The simulation results are in agreement with the benchmark values, verifying that the present methodology is valid and will be a strong tool for two-dimensional flow and heat transfer simulations, especially in the case of complex boundaries.