Indoor pathfinding and routing need fast ways to define connected navigable space, which represents usable paths. This is important because the interior space in buildings changes and often does not follow the architectural design. A workflow is presented that uses a linear octree to segment the space contained in an indoor point cloud, and subsequently derives the structured and connected empt...

Octrees are useful for object representation when fast access to coarse spatial occupancy information is necessary. This paper presents an efficient algorithm for generating octrees from multiple perspective views of an object. The algorithm first obtains a polygonal approximation of the object silhouette. This polygon is then decomposed into convex components. For each convex component, a pyra...

This paper proposes an octree-based surface representation for KinectFusion, a realtime reconstruction technique of in-door scenes using a low-cost moving depth camera and a commodity graphics hardware. In KinectFusion, the scene is represented as a signed distance function (SDF) and stored as an uniform grid of voxels. Though the grid-based SDF is suitable for parallel computation in graphics ...

Many applications that use octrees require that the octree decomposition be smooth throughout the domain with no sharp change in size between spatially adjacent octants, thus impose a so-called 2-to-l constraint on the octree datasets. The process of enforcing the 2-to-l constraint on an existing octree dataset is called balance refinement. Although it is relatively easy to conduct balance refi...

Number of recent technologies take Geographic Information Systems to new levels of power and usability. One of the most promising technologies that empower Geographic Information Systems is the 3D GIS modeling. In this paper, a novel robust multilevel data structure model called EBOT model (block octree tetrahedron mode Geographic Information Systems l) is presented on the basis of BOT visualiz...

An empirical study has been conducted to determine the optimal bucket size for the bucket PR octree while calculating the vertex distortion of tetrahedral meshes. The motivation is to study the effects of the bucket PR octree data structure. This study implemented the data structure using the Java programming language and its libraries and found that the optimal bucket size was 32. This paper a...

A three-dimensional anisotropic metric for geometry-based mesh adaptation is constructed from a triangulated domain definition. First, a Cartesian background octree is refined according to not only boundary curvature but also a local separation criterion from digital topology theory. This octree is then used to extract the domain skeleton through a medial axis transform. Finally, an efficient a...

2 Quadtrees 2 2.1 Definition and Neighbor-Finding . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.2 Height Field Visualization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.3 Isosurface Generation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.4 Ray Shooting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....

This paper presents a new method for representing Light Propagation Volumes using an octree data structure, and for allowing light from regular point light sources to be injected into them. The resulting technique uses full octrees with the help of a separate data structure for representing the octree structure. The octree structure enables light propagation to be performed at a lower resolutio...

This paper presents a new scheme for image display using radiosity methods. An octree technique performs subdivision of polygons which is required in any radiosity method. The octree-based subdivision not only subdivides polygons into patches, but also produces a sequence of leaf octants implicitly sorted in the octree. By traversing the octree, a depth priority of these leaf octant,s with resp...