Voxel-based representation of 3D point clouds: Methods, applications, and its potential use in the construction industry
Point clouds acquired through laser scanning and stereo vision techniques have been
applied in a wide range of applications, proving to be optimal sources for map** 3D urban …
applied in a wide range of applications, proving to be optimal sources for map** 3D urban …
[HTML][HTML] A literature review of bounding volumes hierarchy focused on collision detection
A bounding volume is a common method to simplify object representation by using the
composition of geometrical shapes that enclose the object; it encapsulates complex objects …
composition of geometrical shapes that enclose the object; it encapsulates complex objects …
An efficient geometry-adaptive mesh refinement framework and its application in the immersed boundary lattice Boltzmann method
This work presents an adaptive mesh refinement (AMR) method. This AMR is based on a
pointless representation of octrees, ie hash table. An individual hash table is used for each …
pointless representation of octrees, ie hash table. An individual hash table is used for each …
GPU-based Parallel R-tree Construction and Querying
An R-tree is a data structure for organizing and querying multi-dimensional non-uniform and
overlap** data. Efficient parallelization of R-tree is an important problem due to societal …
overlap** data. Efficient parallelization of R-tree is an important problem due to societal …
Object composite query method using IFC and LandXML based on BIM linkage model
Abstract Recently, querying Building Information Modeling (BIM) objects effectively in a
linkage manner based on shape information using the LandXML schema widely utilized in …
linkage manner based on shape information using the LandXML schema widely utilized in …
Fast generation of pointerless octree duals
Geometry processing applications frequently rely on octree structures, since they provide
simple and efficient hierarchies for discrete data. However, octrees do not guarantee direct …
simple and efficient hierarchies for discrete data. However, octrees do not guarantee direct …
Design and implementation of a parallel priority queue on many-core architectures
An efficient parallel priority queue is at the core of the effort in parallelizing important non-
numeric irregular computations such as discrete event simulation scheduling and branch …
numeric irregular computations such as discrete event simulation scheduling and branch …
Linkless octree using multi‐level perfect hashing
The standard C/C++ implementation of a spatial partitioning data structure, such as octree
and quadtree, is often inefficient in terms of storage requirements particularly when the …
and quadtree, is often inefficient in terms of storage requirements particularly when the …
A Highly Scalable Matrix-Free Multigrid Solver for μFE Analysis Based on a Pointer-Less Octree
C Flaig, P Arbenz - Large-Scale Scientific Computing: 8th International …, 2012 - Springer
The state of the art method to predict bone stiffness is micro finite element (μ FE) analysis
based on high-resolution computed tomography (CT). Modern parallel solvers enable …
based on high-resolution computed tomography (CT). Modern parallel solvers enable …
[PDF][PDF] Compact Generative Models of Point Cloud Data for 3D Perception.
B Eckart - 2017 - ri.cmu.edu
One of the most fundamental tasks for any robotics application is the ability to adequately
assimilate and respond to incoming sensor data. In the case of 3D range sensing, modern …
assimilate and respond to incoming sensor data. In the case of 3D range sensing, modern …