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.

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.

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

High capacity reversible data hiding in encrypted images based on adaptive quadtree partitioning and MSB prediction

To improve the embedding capacity of reversible data hiding in encrypted images(RDH-EI),a new RDH-EI scheme is proposed based on adaptive quadtree partitioning and most significant bit(MSB)prediction.First,according to the smoothness of the image,the image is partitioned into blocks based on adaptive quadtree partitioning,and then blocks of different sizes are encrypted and scrambled at the block level to resist the analysis of the encrypted images.In the data embedding stage,the adaptive MSB prediction method proposed by Wang and He(2022)is improved by taking the upper-left pixel in the block as the target pixel,to predict other pixels to free up more embedding space.To the best of our knowledge,quadtree partitioning is first applied to RDH-EI.Simulation results show that the proposed method is reversible and separable,and that its average embedding capacity is improved.For gray images with a size of 512×512,the average embedding capacity is increased by 25565 bits.For all smooth images with improved embedding capacity,the average embedding capacity is increased by about 35530 bits.

A non-uniform quadtree map building method including dead-end semantics extraction

To reduce the complexity of large-scene high-resolution maps while using the dead-end information distributed in the unmanned vehicle driving environment,we propose a novel non-uniform quadtree map-building method including dead-end semantic information extraction.By utilizing quadtree data structures,submaps and a positive-order tree depth organization approach,our proposed map can adapt to the large-scale high-resolution requirement and expand more easily to larger environments.To verify the practicality of our proposed map,we have successfully implemented map matching and path planning in real environments.Additionally,we effectively extract the dead-end semantic information that widely distributes in the environment,which can help unmanned vehicles avoid collisions and improve the search efficiency of the planning procedure.We evaluate our method with KITTI datasets,CARLA Simulator,and our self-collected real-world datasets.The experimental results show that our proposed method significantly reduces the complexity of large-scale high-resolution maps,effectively extracts dead-end semantic information,and has good practicality in real environments.The implementation of our method is released here:https://github.com/biter0088/Non-uniform-quadtree-map.

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.

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.

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.

An optimized hexagonal quadtree encoding and operation scheme for icosahedral hexagonal discrete global grid systems

Although research on the discrete global grid systems (DGGSs) has become an essential issue in the era of big earth data,there is still a gap between the efficiency of current encoding and operation schemes for hexagonal DGGSs and the needs of practical applications. This paper proposes a novel and efficient encoding and operation scheme of an optimized hexagonal quadtree structure (OHQS) based on aperture 4 hexagonal discrete global grid systems by translation transformation. A vector model is established to describe and calculate the aperture 4 hexagonal grid system. This paper also provides two different grid code addition algorithms based on induction and ijk coordinate transformation. We implement the transformation between OHQS codes and geographic coordinates through the ij,ijk and IJK coordinate systems. Compared with existing schemes,the scheme in this paper greatly improves the efficiency of the addition operation,neighborhood retrieval and coordinate transformation,and the coding is more concise than other aperture 4 hexagonal DGGSs. The encoding operation based on the ijk coordinate system is faster than the encoding operation based on the induction and addition table. Spatial modeling based OHQS DGGSs are also provided. A case study with rainstorms demonstrated the availability of this scheme.

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.

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.

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.

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.

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

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

Kinematic inventory of rock glaciers in the Nyainqentanglha Range using the MT-InSAR method

Rock glaciers are typical periglacial landforms with tongue or lobate morphological shapes and characterized by the distinct front,lateral margins,and often by ridge-and-furrow surface topography textures as well as kinematic characteristics,widely distributed in alpine environments.Multitemporal Synthetic aperture radar interferometry(MT-InSAR),is a remote sensing technique with demonstrated effectiveness for detecting landform kinematics.However,its application to rock glaciers is challenged by temporal decorrelation and atmospheric phase noises due to complex topography and snow cover.We designed a quadtree segmentation and parallel computing-based MT-InSAR method to improve the quality and efficiency of deformation measurement of rock glaciers.We applied the method to a rock glacier inventory of the Nyainqentanglha Range,China,derived from high-resolution Gaofen-2 images,to quantify the activity rate of each rock glacier.Results showed that 32.1%(6,389)of the identified rock glaciers exhibited slope-parallel deformation rates exceeding 100 mm/y.The activities of the rock glaciers exhibited strong correlations with their distance to glaciers,precipitation,freeze-thaw magnitude,and permafrost occurrence probability.The results demonstrate the effectiveness of the developed segmentation-parallel MT-InSAR method for monitoring rock glacier deformation over a large region.

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

打手势分割在里面因为运动，移动照相机录像是一项很挑战性的任务在照相机和动人的目标之间的依赖。照相机运动赔偿作为一条有效途径被认出。然而，存在工作取决于在照相机运动和景色上优先知识为模型选择的结构。这不在实践总是是可得到的。而且，图象飞机运动受不了深度变化，它导致深度依赖者在 3D 的运动分割场面。解决这些问题，这份报纸由介绍基于的修改 Helmholtz 农夫分解(HHD ) 开发一个优先免费的依赖运动分割算法目标运动面向的地图(OOM ) 。由把图象运动(光流动) 分解成一没有卷屈并且一个没有分叉的部件，各种导致照相机的图象运动能被这代表以一个不变的方法的二个部件。HHD 识别导致照相机的图象运动作为一个片断不管深度在 OOM 的帮助下的变化。到片断反对从景色打手势，我们部署标记的新奇时间空间的抑制 quadtree。基准上的广泛的试验性的结果证明我们的方法改进表演在 10% 最先进 ~20% 甚至在有复杂背景的挑战性的场面上。

VGIS-COLLIDE:an effective collision detection algorithm for multiple objects in virtual geographic information system

Collision detection is an important component in simulation applications which are based on virtual geographic information system(VGIS).In this paper,an effective collision detection algorithm for multiple objects in VGIS,VGISCOLLIDE,is presented.The algorithm firstly integrates existing quadtree,which is the global hierarchical structure of VGIS,with axis-aligned bounding box of object to perform the broad-phase of collision detection.After that,exact collision detection between two objects which have passed the broad-phase of collision detection is performed.The algorithm makes no assumption about input primitives or object’s motion and is directly applicable to all triangulated models.It can be applicable to both rigid and deformable objects without preprocessing.The performance of the algorithm has been demonstrated in several environments consisting of a high number of objects with hundreds of thousands of triangles.

Improving Linked-Lists Using Tree Search Algorithms for Neighbor Finding in Variable-Resolution Smoothed Particle Hydrodynamics

Improving linked-lists for neighbor finding with the use of tree search algorithms is proposed here,aiming to cope with highly non-uniform resolution simulations employing a meshless method.The new procedure,coined Quadtree Cells Grid,has been implemented in Smoothed Particle Hydrodynamics(SPH).The SPH scheme employed is adaptive,thus allowing for particle refinement in desired regions of the flow.Owing to the wide range of coexisting particle mass levels,standard linked-list neighbor search algorithms become ineffective.Hence,an alternative is found based on the use of hierarchical data structures,using quadtrees(in 2D problems).The present algorithm exploits the advantages of both linked-lists and quadtree meth-ods with the goal of increasing computational efficiency,when dealing with highly non-uniform particle distributions.Test cases involving two distinct flow problems have demonstrated that the computational cost of the current adaptive neighbor finding algorithm scales linearly with the total number of particles,thus retrieving this characteristic of linkedlists in uniform grid search.Nevertheless,the memory usage increased as a result of the more complex data structure.