Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,284,383 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Array data structure
List of data structures
Octree
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Using a linear octree to identify empty space in indoor point clouds for 3 D pathfinding
T. Broersen
,
F. Fichtner
2016
Corpus ID: 39711178
Indoor pathfinding and routing need fast ways to define connected navigable space, which represents usable paths. This is…
Expand
2006
2006
An algorithm for hidden surface based on linear octrees
Dai Li-xiong
2006
Corpus ID: 63684948
In order to reduce the computation of intersections between lines and surfaces,a new algorithm was presented based on the…
Expand
2005
2005
Encoding Compression Algorithm of Linear Octree Based on Three-Dimensional Point Cloud Data
He Ming-yi
2005
Corpus ID: 64045401
Octree is a grid structure which broadly used in the three-dimensional modeling. Based on the 3D point cloud data, an improved…
Expand
1995
1995
Parallel Display of Objects Represented by Linear Octrees
D. Ibaroudene
,
R. Acharya
IEEE Trans. Parallel Distributed Syst.
1995
Corpus ID: 10220604
The storage, display, and manipulation of three dimensional volumetric information requires large amounts of computing resources…
Expand
1994
1994
Efficient Algorithms for Octree Motion
Andrew Smith
,
Y. Kitamura
,
F. Kishino
IAPR International Workshop on Machine Vision…
1994
Corpus ID: 1098386
This paper presents e cient algorithms for updating moving octrees. The rst algorithm works for octrees undergoing both…
Expand
1992
1992
Three-dimensional predictive deposit modelling based on the linear octree data structure
R. Prissang
1992
Corpus ID: 61074870
The linear octree data structure is based on a spatial enumeration scheme to index subcubes in a recursively decomposed universe…
Expand
1991
1991
A new linear octree construction by filling algorithms
Shin-Nine Yang
,
T. Lin
[ Proceedings] Tenth Annual International Phoenix…
1991
Corpus ID: 62414817
A novel linear octree construction based on filling the closed voxel-based border is proposed. The algorithm is based on a…
Expand
1990
1990
A translucent display algorithm for G-octree represented grey-scale images
Xiaoyang Mao
,
I. Fujishiro
,
T. Kunii
Comput. Animat. Virtual Worlds
1990
Corpus ID: 12593158
A new translucent display algorithm is proposed for grey-scale images represented by G-octrees. The algorithm generates a special…
Expand
1989
1989
Hidden Octree Node Removal as a Pipeline Process
B. Heal
Computer graphics forum (Print)
1989
Corpus ID: 195709269
A processing pipeline solution to the generation and display of octree encoded 3‐D objects is described. Particular emphasis is…
Expand
1986
1986
Viewing Transformations of Voxel-Based Objects Via Linear Octrees
I. Gargantini
,
T. Walsh
,
O. Wu
IEEE Computer Graphics and Applications
1986
Corpus ID: 14955643
This article gives three viewing-transformation algorithms for displaying on a screen 3D pictures represented by linear octrees…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE