4.7 Article

Fast Evaluation of Smooth Distance Constraints on Co-Dimensional Geometry

期刊

ACM TRANSACTIONS ON GRAPHICS
卷 41, 期 4, 页码 -

出版社

ASSOC COMPUTING MACHINERY
DOI: 10.1145/3528223.3530093

关键词

smooth distances; co-dimensional geometry

资金

  1. NSERC [RGPIN-2017-05524]
  2. Connaught Fund [503114]
  3. Ontario Early Researchers Award [ER19-15-034]
  4. Canada Research Chairs Program

向作者/读者索取更多资源

This paper presents a new method for computing a smooth minimum distance function for point clouds, edge meshes, and triangle meshes. The method introduces blending weights and an improved acceleration approach to accurately approximate the true distance and evaluate efficiently. It also has the capability to handle sparsely sampled and noisy data, bridging the gap between data acquisition and simulation and enabling new applications such as direct, co-dimensional rigid body simulation using unprocessed lidar data.
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 approximates the true distance, and is conservative (points outside the zero isosurface are guaranteed to be outside the surface) and efficient to evaluate for all the above data types. This, in combination with its ability to smooth sparsely sampled and noisy data, like point clouds, shortens the gap between data acquisition and simulation, and thereby enables new applications such as direct, co-dimensional rigid body simulation using unprocessed lidar data.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据