Dual Hierarchy for Gravitational n-body

The n-body problem is the simulation of pair-wise interactions between n objects. This problem appears in many forms, with the classic example being the modeling of gravitational forces between point masses, necessary for cosmological simulations. Many approximation approaches have been devised to reduce the complexity of this problem.<br/><br/...

Lossy Geometry Compression for High Resolution Voxel Scenes

Representing geometry data as voxels allows for a massive amount of detail that can be rendered in real-time. Storing this type of data as a directed acyclic graph (DAG) has recently led to immense improvements in memory consumption, which is one of the main limitations often associated with voxel-based approaches. We present a method for...

Representing Large Virtual Worlds

The ubiquity of large virtual worlds and their growing complexity in computer graphics require efficient representations. This means that we need smart solutions for the underlying storage of these complex environments, but also for their visualization. How the virtual world is best stored and how it is subsequently shown to the user in an...

Scalable information extraction from point cloud data obtained by mobile laser scanner

The rise of intelligent transportation, autonomous driving and 3D virtual cities demands highly accurate and regularly updated 2D and 3D maps. However, traditional surveying andmapping techniques are inadequate as they are labor intensive and cost inefficient. Mobile Laser Scanning (MLS) systems, which combine Light Detection and Ranging (LiDAR)...

Indoor A* Pathfinding through an Octree Representation of a Point Cloud

There is a growing demand of 3D indoor pathfinding applications. Researched in the field of robotics during the last decades of the 20th century, these methods focussed on 2D navigation. Nowadays we would like to have the ability to help people navigate inside buildings or send a drone inside a building when this is too dangerous for people....

The effect of A* pathfinding characteristics on the path length and performance in an octree representation of an indoor point cloud

This thesis presents a new workflow for path finding through an octree representation of an indoor point cloud. I applied the following steps: 1) the point cloud is processed so it fits best in an octree; 2) during the octree generation the interior empty nodes are identified and further processed; 3) for each interior empty node the distance to...

Semantic enrichment of a point cloud based on an octree for multi-storey pathfinding

Acquiring point clouds of indoor environments became increasingly accessible in recent years. However, the resulting 3D point cloud data is unstructured, and does not contain enough information to be useful for complex tasks like pathfinding. Indoor models which are currently derived from point clouds do not include furniture and stairs. The...