39 research outputs found
Efficient computation of discrete Voronoi diagram and homotopy-preserving simplified medial axis of a 3d polyhedron
The Voronoi diagram is a fundamental geometric data structure and has been well studied in computational geometry and related areas. A Voronoi diagram defined using the Euclidean distance metric is also closely related to the Blum medial axis, a well known skeletal representation. Voronoi diagrams and medial axes have been shown useful for many 3D computations and operations, including proximity queries, motion planning, mesh generation, finite element analysis, and shape analysis. However, their application to complex 3D polyhedral and deformable models has been limited. This is due to the difficulty of computing exact Voronoi diagrams in an efficient and reliable manner. In this dissertation, we bridge this gap by presenting efficient algorithms to compute discrete Voronoi diagrams and simplified medial axes of 3D polyhedral models with geometric and topological guarantees. We apply these algorithms to complex 3D models and use them to perform interactive proximity queries, motion planning and skeletal computations. We present three new results. First, we describe an algorithm to compute 3D distance fields of geometric models by using a linear factorization of Euclidean distance vectors. This formulation maps directly to the linearly interpolating graphics rasterization hardware and enables us to compute distance fields of complex 3D models at interactive rates. We also use clamping and culling algorithms based on properties of Voronoi diagrams to accelerate this computation. We introduce surface distance maps, which are a compact distance vector field representation based on a mesh parameterization of triangulated two-manifolds, and use them to perform proximity computations. Our second main result is an adaptive sampling algorithm to compute an approximate Voronoi diagram that is homotopy equivalent to the exact Voronoi diagram and preserves topological features. We use this algorithm to compute a homotopy-preserving simplified medial axis of complex 3D models. Our third result is a unified approach to perform different proximity queries among multiple deformable models using second order discrete Voronoi diagrams. We introduce a new query called N-body distance query and show that different proximity queries, including collision detection, separation distance and penetration depth can be performed based on Nbody distance query. We compute the second order discrete Voronoi diagram using graphics hardware and use distance bounds to overcome the sampling errors and perform conservative computations. We have applied these queries to various deformable simulations and observed up to an order of magnitude improvement over prior algorithms
DiFi: Fast Distance Field Computation using Graphics Hardware
Abstract We present a novel algorithm for fast computation of discretized distance fields using graphics hardware
Local Deep Implicit Functions for 3D Shape
The goal of this project is to learn a 3D shape representation that enables
accurate surface reconstruction, compact storage, efficient computation,
consistency for similar shapes, generalization across diverse shape categories,
and inference from depth camera observations. Towards this end, we introduce
Local Deep Implicit Functions (LDIF), a 3D shape representation that decomposes
space into a structured set of learned implicit functions. We provide networks
that infer the space decomposition and local deep implicit functions from a 3D
mesh or posed depth image. During experiments, we find that it provides 10.3
points higher surface reconstruction accuracy (F-Score) than the
state-of-the-art (OccNet), while requiring fewer than 1 percent of the network
parameters. Experiments on posed depth image completion and generalization to
unseen classes show 15.8 and 17.8 point improvements over the state-of-the-art,
while producing a structured 3D representation for each input with consistency
across diverse shape collections.Comment: Camera ready version for CVPR 2020 Oral. Prior to review, this paper
was referred to as DSIF, "Deep Structured Implicit Functions." 11 pages, 9
figures. Project video at https://youtu.be/3RAITzNWVJ