mlsanityData to 14 Oct 2026

Developability Approximation for Neural Implicits through Rank Minimization

arXiv 2308.03900 ↗First posted 7 Aug 2023cs.CV cs.GRcited by 3

Not on the map. Why?

Abstract (arXiv)

Developability refers to the process of creating a surface without any tearing or shearing from a two-dimensional plane. It finds practical applications in the fabrication industry. An essential characteristic of a developable 3D surface is its zero Gaussian curvature, which means that either one or both of the principal curvatures are zero. This paper introduces a method for reconstructing an approximate developable surface from a neural implicit surface. The central idea of our method involves incorporating a regularization term that operates on the second-order derivatives of the neural implicits, effectively promoting zero Gaussian curvature. Implicit surfaces offer the advantage of smoother deformation with infinite resolution, overcoming the high polygonal constraints of state-of-the-art methods using discrete representations. We draw inspiration from the properties of surface curvature and employ rank minimization techniques derived from compressed sensing. Experimental results on both developable and non-developable surfaces, including those affected by noise, validate the generalizability of our method.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 15 of its 42 references that are in the map. First posted on arXiv 7 Aug 2023.

Builds on

15 of 42 references.

References · 15

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2019DeepSDF: Learning Continuous Signed Distance Functions for Shape Representationcited by 2,689
  3. 2020Implicit Neural Representations with Periodic Activation Functionscited by 2,238
  4. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
  5. 2018Learning Implicit Fields for Generative Shape Modelingcited by 1,060
  6. 2017Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learningcited by 950
  7. 2020Implicit Geometric Regularization for Learning Shapescited by 710
  8. 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
  9. 2019Cubic Stylizationcited by 14
  10. 2015Partial Sum Minimization of Singular Values in Robust PCA: Algorithm and Applicationscited by 11
  11. 2017Natural Boundary Conditions for Smoothing in Geometry Processingcited by 5
  12. 2017Discrete Geodesic Nets for Modeling Developable Surfacescited by 2
3 more
  1. 2018Optimizing B-spline surfaces for developability and paneling architectural freeform surfacescited by 2
  2. 2020Low-Rank Factorization for Rank Minimization with Nonconvex Regularizerscited by 2
  3. 2021Dev2PQ: Planar Quadrilateral Strip Remeshing of Developable Surfacescited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 1.

3 papers.