Search Results for author:
Found 9 papers, 1 papers with code
A Survey of Methods for Converting Unstructured Data to CSG Models
The goal of this document is to survey existing methods for recovering CSG representations from unstructured data such as 3D point-clouds or polygon meshes.
Solving Large Steiner Tree Problems in Graphs for Cost-Efficient Fiber-To-The-Home Network Expansion
The expansion of Fiber-To-The-Home (FTTH) networks creates high costs due to expensive excavation procedures.
Reconstruction of Convex Polytope Compositions from 3D Point-clouds
Reconstructing a composition (union) of convex polytopes that perfectly fits the corresponding input point-cloud is a hard optimization problem with interesting applications in reverse engineering and rigid body dynamics simulations.
A Flexible Pipeline for the Optimization of CSG Trees
CSG trees are an intuitive, yet powerful technique for the representation of geometry using a combination of Boolean set-operations and geometric primitives.
Accelerating Evolutionary Construction Tree Extraction via Graph Partitioning
Extracting a Construction Tree from potentially noisy point clouds is an important aspect of Reverse Engineering tasks in Computer Aided Design.
Content-based Recommendations for Radio Stations with Deep Learned Audio Fingerprints
That is why finding stations playing the preferred content is a tough task for a potential listener, especially due to the overwhelming number of offered choices.
Bayesian Surprise in Indoor Environments
Agents of LBS, such as mobile robots or non-player characters in computer games, may use the context surprise to focus more on important regions of a map for a better use or understanding of the floor plan.
Optimizing Geometry Compression using Quantum Annealing
The compression of geometry data is an important aspect of bandwidth-efficient data transfer for distributed 3d computer vision applications.
Memory Bounded Open-Loop Planning in Large POMDPs using Thompson Sampling
State-of-the-art approaches to partially observable planning like POMCP are based on stochastic tree search.
