This paper introduces the marching cube octree data structure, a new scheme for representing and generating the mesh of various level-of-details (LODs). The marching cube octree is based on the data structure of the Marching Cube algorithm [1 ], which is used to generate the mesh from the range data and the octree, this last widely used in computer graphics. Our LOD model can support adaptive s...

In this paper, we present a novel 2-refinement algorithm for adaptive all-hexahedral mesh generation based on two tree structures: octree and rhombic dodecahedral tree. Given a smooth boundary surface, we first use a pre-defined error function to detect the main surface features, and build a strongly-balanced octree. Then a novel 2-refinement algorithm is developed to eliminate all hanging node...

We present a parallel surface reconstruction algorithm that runs entirely on the GPU. Like existing implicit surface reconstruction methods, our algorithm first builds an octree for the given set of oriented points, then computes an implicit function over the space of the octree, and finally extracts an isosurface as a water-tight triangle mesh. A key component of our algorithm is a novel techn...

The main goal of this project was to explore the possibility of applying CUDA to the Point Based Color Bleeding global illumination algorithm. This project tackled the creation of surfels, the storage of surfels in an octree, representation of an octree in CUDA, and the transversal of an octree in CUDA. Future work will include the rasterization step of the Point Based Color Bleeding algorithm ...

When rendering a volume represented as a 3D grid, it takes a long time to check the cells that do not intersect the surface. Wilhelms et al. proposed using an octree as a hierarchical index, keeping the maximum and minimum cell value for each voxel, in order to avoid processing empty cells. Their method used a complete octree which required a large amount of space. We propose a new indexing met...

Octree Splitting We extend the irregular pyramid segmentation scheme to three dimensional (3D) digital space and we call it hyper-irregular pyramid segmentation. Based on this segmentation scheme, a 3D texture image is split into partitions recursively based on octree structure. The testure features are calculated based on 3D gray level spatial dependency measurement. The octree is subsequently...

We present a new algorithm for compressing surfaces created from oriented points, sampled using a laser range scanner or created from polygonal surfaces. We first use the input data to build an octree whose nodes contain planes that are constructed as the least square fit of the data within that node. Then, given an error threshold, we prune this octree to remove redundant data while avoiding t...

Interpolating discrete volume data into a continuous form adapts implicit surface techniques for rendering volumetric iso-surfaces. One such algorithm uses the Lipschitz condition to create an octree representation that accelerates volume rendering. Furthermore, only one preprocessing step is needed to create the Lipschitz-octree representation that accelerates rendering of iso-surfaces for any...