Linear octree

Known as: Linear octrees

A linear octree is an octree that is represented by a linear array instead of a tree data structure. To simplify implementation, a linear octree is…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2009

In order to meet the need of interactive operation in 3D graphic systems, a hardware accelerated based algorithm for fast and…

2006

In order to reduce the computation of intersections between lines and surfaces,a new algorithm was presented based on the…

2005

Octree is a grid structure which broadly used in the three-dimensional modeling. Based on the 3D point cloud data, an improved…

2004

Many applications that use octrees require that the octree decomposition be smooth throughout the domain with no sharp change in…

1995

The storage, display, and manipulation of three dimensional volumetric information requires large amounts of computing resources…

1994

This paper presents e cient algorithms for updating moving octrees. The rst algorithm works for octrees undergoing both…

1992

The linear octree data structure is based on a spatial enumeration scheme to index subcubes in a recursively decomposed universe…

1991

A novel linear octree construction based on filling the closed voxel-based border is proposed. The algorithm is based on a…

1990

A new translucent display algorithm is proposed for grey-scale images represented by G-octrees. The algorithm generates a special…

1986

This article gives three viewing-transformation algorithms for displaying on a screen 3D pictures represented by linear octrees…