Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The forest-of-octrees approach to parallel adaptive mesh refinement and coarsening has recently been demonstrated in the context… Expand
  • table 2.1
  • figure 2.1
  • table 2.2
  • figure 2.2
  • figure 4.1
Is this relevant?
2010
2010
A parallel octree-based mesh generation method is proposed to create reasonable-quality, geometry-adapted unstructured hexahedral… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
In this article, we propose new parallel algorithms for the construction and 2:1 balance refinement of large linear octrees on… Expand
  • table 1
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
This paper presents a solution to the problem of balance refinement of massive linear octrees. We combine existing database… Expand
Is this relevant?
1995
1995
Ray tracing requires many ray-object intersection tests. A way of reducing the number of ray-object intersection tests is to… Expand
  • figure 2
  • figure 1
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
1994
1994
Abstract The linear octree is an efficient data structure for compact representation of voxel data. There are several algorithms… Expand
  • figure 1
  • figure 3
  • figure 4
  • table 1
Is this relevant?
1991
1991
Abstract The representation and manipulation of 3D objects are important for applications such as computer graphics, pattern… Expand
Is this relevant?
1990
1990
Abstract A formula for deriving the rectangular coordinates X, Y and Z from the octal locational code of a linear octree node is… Expand
Is this relevant?
1989
1989
Abstract The paper describes a new algorithm for constructing a 3D approximation of an object from three orthogonal 2D… Expand
  • figure 1
  • figure 2
Is this relevant?
1989
1989
  • Hanan Samet
  • Comput. Vis. Graph. Image Process.
  • 1989
  • Corpus ID: 16399394
Abstract Algorithms are presented for moving between adjacent blocks in an octree representation of an image. Motion is possible… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?