Octree structures are widely used in graphic applications to accelerate the computation of geometric proximity relations. This data strucutre is fundamental for game engine architectures for a correct scene management and culling process. With the increasing power of graphics hardware, processing tasks are progressively ported of to those architectures. However, octrees are essentially hierarch...

This paper presents e cient algorithms for updating moving octrees. The rst algorithm works for octrees undergoing both translation and rotation motion; it works efciently by compacting source octrees into a smaller set of cubes (not necessarily standard octree cubes) as a precomputation step, and by using a fast, exact cube/cube intersection test between source octree cubes and target octree c...

Purpose – This paper aims to investigate automatic assembly planning for robot and manual assembly. Design/methodology/approach – The octree decomposition technique is applied to approximate CAD models with an octree representation which are then used to generate robot and manual assembly plans. An assembly planning system able to generate assembly plans was developed to build these prototype m...

OBJECTIVES The optimal time to initiate adjuvant chemotherapy after surgery in patients with colon cancer is not clear. We investigated the benefit of combined intraportal chemotherapy administered during radical surgery with adjuvant chemotherapy for treating stage II and III colon cancer. METHODS Patients were randomly assigned to OCTREE arm (intraportal chemotherapy plus mFOLFOX6) or a sta...

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...

Three dimensional fluid simulation becomes expensive on high resolution grids which can easily consume a large amount of physical memory. This paper presents an octreebased algorithm for visual simulation of smoke on ordinary workstations. This method adaptively subdivides the whole simulation volume into multiple subregions using an octree. Each leaf node in the octree also holds a uniform sub...

We present a new volume rendering algorithm using raycasting and texture mapping formulations for parallel projection in this paper. The volume is represented and stored in an eecient octree data structure. The octree blocks are adaptively chosen to minimize unnecessary processing of empty voxels. The algorithm exploits the uniform shape, orientation and size of the octree blocks by building te...

Recursive algorithms are generally not straightforward to be processed in parallel, particularly when an octree is involved. Some researchers have tried to process an octree in parallel, but this solution is restricted to recursive subdivision methods that guarantee surface containment in an octant. In this paper we show a whole class of recursive subdivision algorithms which does not fall into...

Light detection and ranging (LIDAR) instruments collect high density and accurate 3D point clouds of scanned surfaces of objects. For the applications of building reconstruction from ground based LIDAR, the most fundamental spatial information to be extracted are plane features. ZE Modeller implements a point cloud registration and geo-referencing alogithm. Further, ZE Modeller also offers an a...

Three robust blind watermarking methods of 3D models based on Octree are proposed in this paper: OTC-W, OTP-W and Zero-W. Primary Component Analysis and Octree partition are used on 3D meshes. A scrambled binary image for OTC-W and a scrambled RGB image for OTP-W are separately embedded adaptively into the single child nodes at the bottom level of Octree structure. The watermark can be extracte...