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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1984-2017
02419842017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
A new collision detection algorithm is presented that solves the all-pairs collision detection problem using parallel processing… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
The complex field integrated model based on linear octree was established, which can improve data storage compression ratio. Then… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2010
2010
A parallel octree-based mesh generation method is proposed to create reasonable-quality, geometry-adapted unstructured hexahedral… (More)
  • 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… (More)
  • table 1
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
In this article we propose parallel algorithms for the construction of conforming finite-element discretization on linear octrees… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
Many applications that use octrees require that the octree decomposition be smooth throughout the domain with no sharp change in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2004
2004
Generating large 3D unstructured meshes with over 1 billion elements has been a challenging task. Fortunately, for a large class… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
This paper presents the design, implementation, and evaluation of the etree, a database-oriented method for large out-of-core… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1994
1994
The linear octree is an efficient data structure for compact representation of voxel data. There are several algorithms to… (More)
  • figure 1
  • figure 3
  • figure 4
  • table 1
Is this relevant?
1994
1994
This paper presents e cient algorithms for updating moving octrees. The rst algorithm works for octrees undergoing both… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?