A new hybrid coding method for compressing animated polygonal meshes is presented. This paper assumes the simplistic representation of the geometric data: a temporal sequence of polygonal meshes for each discrete frame of the animated sequence. The method utilizes a delta coding and an octree-based method. In this hybrid method, both the octree approach and the delta coding approach are applied...

Volume-based reconstruction is usually expensive both in terms of memory consumption and runtime. Especially for sparse geometric structures, volumetric representations produce a huge computational overhead. We present an efficient way to fuse range data via a variational Octree-based minimization approach by taking the actual range data geometry into account. We transform the data into Octree-...

In this paper we present a progressive compression method for point sampled models that is specifically apt at dealing with densely sampled surface geometry. The compression is lossless and therefore is also suitable for storing the unfiltered, raw scan data. Our method is based on an octree decomposition of space. The point-cloud is encoded in terms of occupied octree-cells. To compress the oc...

The Surface Octree (SO) is an extension of the Classical Octree used to maintain a decimated codification of a surface while preserving volume data information. Constrained by a region of maximal interest, we present an algorithm to extract a multiresolution surface from a SO data structure. This algorithm reconstructs the surface with maximal precision in the focus of interest and at progressi...

In this paper we address the problem of fast inclusion tests and distance calculation in very large models, an important issue in the context of environments involving haptic interaction or collision detection. Unfortunately, existing haptic rendering or collision detection toolkits cannot handle polygonal models obtained from 3D digitized point clouds unless the models are simplified up to a f...

Discretized distance maps have been used in robotics for path planning and eecient collision detection applications in static environments 1]. However, they have been used at the nest level of resolution, thereby making them memory intensive. In this paper, we propose an octree-based hierarchical representation for discretized distance maps, called Octree Distance Maps (ODM), and show its use i...

The United State Department of Energy (DOE) is facing a large task in characterizing and remediating waste tanks and their contents. Because of the hazardous materials inside the waste tanks, all of the work must be done remotely. The purpose of this paper is to show how to reconstruct an enclosed environment from various scans of a Laser Range Finder (LRF). The reconstructed environment can th...

An novel method using local convexity and octree is proposed to segment irregular 3D point cloud into surfaces. An modified octree method is used to produce the init facet set which usually contains too many facets and is meaningless, and then the connection of the leaf nodes is found. Finally, the adjacent facets are combined if they satisfied the local convexity. The proposed method is applie...

This paper describes the implementation of a three-dimensional mesh generation program based on octree data structures, capable of generating large meshes, operating in a parallel, distributed memory computing under the Single-Program, Multiple-Data model of computation. In order to compensate for the limitations in the standard octree technique, some enhancements to it are developed and implem...

An octree is a recursive partition of the unit cube, such that in each step a cube is subdivided into eight smaller cubes. Those cubes that are not further subdivided are the leaves of the octree. We consider the problem of coloring the leaves of an octree using as few colors as possible such that no two of them get the same color if they share a face. It turns out that the number of colors nee...