SSD: Smooth Signed Distance Surface Reconstruction

被引:147
|
作者
Calakli, F. [1 ]
Taubin, G. [1 ]
机构
[1] Brown Univ, Sch Engn, Providence, RI 02912 USA
基金
美国国家科学基金会;
关键词
INTERPOLATION; IMPLICIT;
D O I
10.1111/j.1467-8659.2011.02058.x
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We introduce a new variational formulation for the problem of reconstructing a watertight surface defined by an implicit equation, from a finite set of oriented points; a problem which has attracted a lot of attention for more than two decades. As in the Poisson Surface Reconstruction approach, discretizations of the continuous formulation reduce to the solution of sparse linear systems of equations. But rather than forcing the implicit function to approximate the indicator function of the volume bounded by the implicit surface, in our formulation the implicit function is forced to be a smooth approximation of the signed distance function to the surface. Since an indicator function is discontinuous, its gradient does not exist exactly where it needs to be compared with the normal vector data. The smooth signed distance has approximate unit slope in the neighborhood of the data points. As a result, the normal vector data can be incorporated directly into the energy function without implicit function smoothing. In addition, rather than first extending the oriented points to a vector field within the bounding volume, and then approximating the vector field by a gradient field in the least squares sense, here the vector field is constrained to be the gradient of the implicit function, and a single variational problem is solved directly in one step. The formulation allows for a number of different efficient discretizations, reduces to a finite least squares problem for all linearly parameterized families of functions, and does not require boundary conditions. The resulting algorithms are significantly simpler and easier to implement, and produce results of quality comparable with state-of-the-art algorithms. An efficient implementation based on a primal-graph octree-based hybrid finite element-finite difference discretization, and the Dual Marching Cubes isosurface extraction algorithm, is shown to produce high quality crack-free adaptive manifold polygon meshes.
引用
收藏
页码:1993 / 2002
页数:10
相关论文
共 50 条
  • [31] VolRecon: Volume Rendering of Signed Ray Distance Functions for Generalizable Multi-View Reconstruction
    Ren, Yufan
    Wang, Fangjinhua
    Zhang, Tong
    Pollefeys, Marc
    Süsstrunk, Sabine
    2023 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2023, : 16685 - 16695
  • [32] A Two-Step Surface Reconstruction Method Using Signed Marching Cubes
    Zhang, Ju
    Zhong, Deyun
    Wang, Liguan
    APPLIED SCIENCES-BASEL, 2022, 12 (04):
  • [33] Polynomial reconstruction of signed graphs
    Simic, Slobodan K.
    Stanic, Zoran
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2016, 501 : 390 - 408
  • [34] The "dead reckoning" signed distance transform
    Grevera, GJ
    COMPUTER VISION AND IMAGE UNDERSTANDING, 2004, 95 (03) : 317 - 333
  • [35] Operations on Signed Distance Function Estimates
    Bálint C.
    Valasek G.
    Gergó L.
    Computer-Aided Design and Applications, 2023, 20 (06) : 1154 - 1174
  • [36] Signed Lp-distance fields
    Belyaev, Alexander
    Fayolle, Pierre-Alain
    Pasko, Alexander
    COMPUTER-AIDED DESIGN, 2013, 45 (02) : 523 - 528
  • [37] Variational Analysis on the Signed Distance Functions
    Luo, Honglin
    Wang, Xianfu
    Lukens, Brett
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2019, 180 (03) : 751 - 774
  • [38] Variational Analysis on the Signed Distance Functions
    Honglin Luo
    Xianfu Wang
    Brett Lukens
    Journal of Optimization Theory and Applications, 2019, 180 : 751 - 774
  • [39] On the distance compatibility in product of signed graphs
    Shijin, T., V
    Soorya, P.
    Hameed, K. Shahul
    Germina, K. A.
    ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2023, 16 (02)
  • [40] Differentiable Signed Distance Function Rendering
    Vicini, Delio
    Speierer, Sebastien
    Jakob, Wenzel
    ACM TRANSACTIONS ON GRAPHICS, 2022, 41 (04):