Fast Evaluation of Smooth Distance Constraints on Co-Dimensional Geometry

08/24/2021
by   Abhishek Madan, et al.
0

We present a new method for computing a smooth minimum distance function (based on the LogSumExp function) for point clouds, edge meshes, triangle meshes, and combinations of all three. We derive blending weights and a modified Barnes-Hut acceleration approach that ensure our method is conservative (points outside the zero isosurface are guaranteed to be outside the surface), accurate and efficient to evaluate for all the above data types. This, in combination with its ability to smooth sparsely sampled data, like point clouds, enhances typical graphics tasks such as sphere tracing and enables new applications such as direct, co-dimensional rigid body simulation using unprocessed lidar data.

READ FULL TEXT

page 1

page 3

page 4

page 5

page 8

page 10

page 12

page 14

research
10/03/2016

Dynamic Polygon Clouds: Representation and Compression for VR/AR

We introduce the polygon cloud, also known as a polygon set or soup, a...
research
07/10/2023

A Fast Geometric Multigrid Method for Curved Surfaces

We introduce a geometric multigrid method for solving linear systems ari...
research
12/20/2018

Three Dimensional Reconstruction of Botanical Trees with Simulatable Geometry

We tackle the challenging problem of creating full and accurate three di...
research
02/02/2023

Efficient Graph Field Integrators Meet Point Clouds

We present two new classes of algorithms for efficient field integration...
research
11/10/2021

Theoretical and empirical analysis of a fast algorithm for extracting polygons from signed distance bounds

We investigate an asymptotically fast method for transforming signed dis...
research
02/05/2020

Polylidar – Polygons from Triangular Meshes

This paper presents Polylidar, an efficient algorithm to extract non-con...

Please sign up or login with your details

Forgot password? Click here to reset