Objects used in real life are normally three dimensional, although many objects are close to being twoor even one dimensional. In geometry, objects can have any number of dimensions, although we cannot visualize objects in more than three dimensions. An N -tree data structure is a special tree that stores an N -dimensional object. The most common example is a quadtree, a popular structure for s...

The results of an investigation in developing a generalized toolkit for Quadtree based Finite Volume models, exemplarily applied on the Shallow Water Equations, are given in this report. The developed application model: (i) discretizes a given topography using a quadtreebased grid system and (ii) solves the Shallow Water Equations by a numerical method based on the Finite Volume Method on the a...

Embedded ZeroBlock Coding and context modeling (EZBC) algorithm has high compression performance. However, it consumes large amounts of memory space because an Amplitude Quadtree of wavelet coefficients and other two link lists would be built during the encoding process. This is one of the big challenges for EZBC to be used in real time or hardware applications. An improved EZBC algorithm based...

In this paper we present a performance comparison of access methods for time-evolving regional data. Initially, we briefly review four temporal extensions of the Linear Region Quadtree: the Time-Split Linear Quadtree, the Multiversion Linear Quadtree, the Multiversion Access Structure for Evolving Raster Images and Overlapping Linear Quadtrees. These methods comprise a family of specialized acc...

Viewpoint adaptation, or 'look-around' capability, is likely to be vital to the success of future immersive multimedia services such as 3D video-conferencing, virtual reality and 3DTV. This paper proposes a low complexity and efficient compression system for multiview images using quadtree disparity estimation and multiview synthesis. Previous approaches to the problem have generally involved t...

An adaptive algorithm is presented for converting the quadtree representation of a binary image to its chain code representation. Our algorithm has the advantage of constructing the chain codes of the resulting quadtree of the Boolean operation of two quadtrees by re-using the original chain codes. This algorithm is adaptive because it can adjust the total number of internal nodes to be stored ...

A rate-distortion framework is used to define a very low bit-rate coding scheme based on quadtree segmentation and optimized selection of motion estimators. This technique achieves maximum reconstructed image quality under the constraint of a target bit rate for the coding of the vector field and segmentation information. First, a complete scheme is proposed for hybrid two-dimensional (2-D) and...

In the social media age, content creation and distribution of all sorts of digital media is of growing importance. The variety of media types, devices, and user groups results in the generated media items being stored in a very heterogeneous landscape which can be seen as a large distributed database consisting of personal computers, mobile devices, or web servers of social media sites, demandi...

The quadtree and the bintree data structures are two variants on the principle of hierarchical regular decomposition applied to image representation. A comparison of the storage requirements for images represented by these two methods is presented. The relative storage efficiency of quadand bintrees is determined by two factors: the relative node sizes for the two representations as determined ...

In this paper, data model and structure of the 3D road model, which is constructed by Constrained Delaunay Triangles (CDT) and integrated with terrain model, are proposed first, and the method of judging the maximum angle was used to build the triangle net. Considering the characters of strip-distributed and data volume of highway, the following two methods are developed to enhance the 3D roami...