Discrete Global Grid has been widely used as the basic data model of digital earth. But it is only confined to the earth surface, and it can not reach to the earth inside or outside. The extended-Octree (e-Octree) spheroid subdivision and coding model proposed here provides a new kind of global 3D grid. This e-Octree model is based on the extension of octree structure, and there are three kinds...

Ray tracing requires many ray-obect intersection tests. A way of reducing the number of ray-object intersection tests is to subdivide the space occupied by objects into many nonoverlapping subregions, called voxels, and to construct an octree for the subdivided space. In this paper, we propose the Octree-R, an octree-variant data structure for efficient ray tracing. The algorithm for constructi...

A hierarchical representation formed by an octree for a volume ray casting is a well-known data structure to skip over transparent regions requiring little preprocessing and storage. However, it accompanies unnecessary comparison and level shift between octants. We propose a new data structure named half-skewed octree, which is an auxiliary octree to support the conventional octree. In preproce...

The octree is a common data structure used to model 3-dimensional data. The linear octree is a compact representation of an octree. In this paper we deal with the problem of displaying three-dimensional objects represented using linear octree, and offer a new, efficient solution. Our algorithm rearranges voxels of a linear octree in order of increasing distance from the viewer, This list is ren...

In this paper, the visualization of hybrid scenes that contain volume data and a fitted extracted surface is addressed. The proposed algorithm is based on a integrated octree-based representation: the ‘‘hybrid octree.’’ The hybrid octree allows to obtain multiresolution representation of the volume data and it also maintains a decimated surface codification. The proposed visualization approach ...

We revisit the generation of balanced octrees for adaptive mesh refinement (AMR) of Cartesian domains with immersed complex geometries. In a recent short note [Hasbestan and Senocak, J. Comput. Phys. vol. 351:473-477 (2017)], we showed that the data-locality of the Z-order curve in hashed linear octree generation methods may not be perfect because of potential collisions in the hash table. Buil...

A novel technique for point rendering in a CUDA path tracer is introduced in this proposal. The approach makes it possible to render point represented geometries with global illumination effects. Octree data structure is combined in order for more efficient intersection determination. Furthermore, Octree enables the users/artists to choose the level of details of the rendered results to achieve...

We propose the PR-star octree as a combined spatial data structure for performing efficient topological queries on tetrahedral meshes. The PR-star octree augments the Point Region octree (PR Octree) with a list of tetrahedra incident to its indexed vertices, i.e. those in the star of its vertices. Thus, each leaf node encodes the minimal amount of information necessary to locally reconstruct th...

We present an octree-based approach supporting multiresolution volume rendering of large data sets. Given a set of scattered points without connectivity information, we impose an octree data structure of low resolution in the preprocessing step. The construction of this initial octree structure is controlled by the original data resolution and cell-speci c error values. Using the octree nodes, ...

This paper describes the Visibility Octree, a data structure to accelerate 3D navigation through very complex scenes. A conservative visibility algorithm that computes and hierarchically stores the structure at a preprocessing stage is presented. The Visibility Octree is used during navigation and its main contribution is its ability to provide an eeective control over the coarseness of the vis...