Add to ORKGIn this work a new SIMD parallel algorithm to generate Classical Octrees from Boundary Representations is presented. The algorithm consists of two main steps. First all the grey terminal nodes in the final octree are determined and encoded in parallel. Then the whole tree is deduced in parallel from the codes determined in the first step in a bottom-top manner.Postprint (published version
Quadtree representation of two-dimensional objects is performed with a tree that describes the recur...
Quadtree representation of two-dimensional objects is performed with a tree that describes the recur...
The development of an automatic, dynamic, parallel, Cartesian, linear forest-of-octree grid generato...
In this work a new SIMD parallel algorithm to generate Classical Octrees from Boundary Representatio...
A new SIMD parallel algorithm to extract a Boundary representation from Classical Octrees is present...
Bottom Up Construction and 2:1 Balance Refinement of Linear Octrees in Parallel In this article, we ...
[[abstract]]A novel linear octree construction based on filling the closed voxel-based border is pro...
The visualization of volumetric datasets is usually limited by the amount of memory and processing p...
Spatial enumeration models are widely used in several fields. These models are approximate but the m...
The paper focuses on automatic simplification algorithms for the generation of a multiresolution f...
Abstract. The forest-of-octrees approach to parallel adaptive mesh refinement and coarsening (AMR) h...
The visualization of volumetric datasets is usually limited by the amount of memory and processing p...
In this article, we propose new parallel algorithms for the construction and 2:1 balance refinement ...
An octree representation of a solid is useful in applications such as finite element mesh generation...
A number of methods for constructing bounding volume hierarchies and point-based octrees on the GPU ...
Quadtree representation of two-dimensional objects is performed with a tree that describes the recur...
Quadtree representation of two-dimensional objects is performed with a tree that describes the recur...
The development of an automatic, dynamic, parallel, Cartesian, linear forest-of-octree grid generato...
In this work a new SIMD parallel algorithm to generate Classical Octrees from Boundary Representatio...
A new SIMD parallel algorithm to extract a Boundary representation from Classical Octrees is present...
Bottom Up Construction and 2:1 Balance Refinement of Linear Octrees in Parallel In this article, we ...
[[abstract]]A novel linear octree construction based on filling the closed voxel-based border is pro...
The visualization of volumetric datasets is usually limited by the amount of memory and processing p...
Spatial enumeration models are widely used in several fields. These models are approximate but the m...
The paper focuses on automatic simplification algorithms for the generation of a multiresolution f...
Abstract. The forest-of-octrees approach to parallel adaptive mesh refinement and coarsening (AMR) h...
The visualization of volumetric datasets is usually limited by the amount of memory and processing p...
In this article, we propose new parallel algorithms for the construction and 2:1 balance refinement ...
An octree representation of a solid is useful in applications such as finite element mesh generation...
A number of methods for constructing bounding volume hierarchies and point-based octrees on the GPU ...
Quadtree representation of two-dimensional objects is performed with a tree that describes the recur...
Quadtree representation of two-dimensional objects is performed with a tree that describes the recur...
The development of an automatic, dynamic, parallel, Cartesian, linear forest-of-octree grid generato...