Search
Now showing items 1-5 of 5
High-Performance Image Filters via Sparse Approximations
(ACM, 2020)
We present a numerical optimization method to find highly efficient (sparse) approximations for convolutional image filters. Using a modified parallel tempering approach,we solve a constrained optimization that maximizes ...
Fast and Robust QEF Minimization using Probabilistic Quadrics
(The Eurographics Association and John Wiley & Sons Ltd., 2020)
Error quadrics are a fundamental and powerful building block in many geometry processing algorithms. However, finding the minimizer of a given quadric is in many cases not robust and requires a singular value decomposition ...
Geodesic Distance Computation via Virtual Source Propagation
(The Eurographics Association and John Wiley & Sons Ltd., 2021)
We present a highly practical, efficient, and versatile approach for computing approximate geodesic distances. The method is designed to operate on triangle meshes and a set of point sources on the surface. We also show ...
Sampling from Quadric-Based CSG Surfaces
(The Eurographics Association and John Wiley & Sons Ltd., 2021)
We present an efficient method to create samples directly on surfaces defined by constructive solid geometry (CSG) trees or graphs. The generated samples can be used for visualization or as an approximation to the actual ...
Compression and Rendering of Textured Point Clouds via Sparse Coding
(The Eurographics Association, 2021)
Splat-based rendering techniques produce highly realistic renderings from 3D scan data without prior mesh generation. Mapping high-resolution photographs to the splat primitives enables detailed reproduction of surface ...