paper-with-me

Papers

Scheduling the Off-Diagonal Weingarten Loss of Neural SDFs for CAD Models

2025-11-05 · Haotian Yin, Przemyslaw Musialski arxiv

Neural signed distance functions (SDFs) have become a powerful representation for geometric reconstruction from point clouds, yet they often require both gradient- and curvature-based regularization to suppress spurious warp and preserve structural fidelity. FlatCAD introduced the Off-Diagonal Weingarten (ODW) loss as an efficient second-order prior for CAD surfaces, approximating full-Hessian regularization at roughly half the computational cost. However, FlatCAD applies a fixed ODW weight throughout training, which is suboptimal: strong regularization stabilizes early optimization but suppresses detail recovery in later stages. We present scheduling strategies for the ODW loss that assign a high initial weight to stabilize optimization and progressively decay it to permit fine-scale refinement. We investigate constant, linear, quintic, and step interpolation schedules, as well as an increasing warm-up variant. Experiments on the ABC CAD dataset demonstrate that time-varying schedules consistently outperform fixed weights. Our method achieves up to a 35% improvement in Chamfer Distance over the FlatCAD baseline, establishing scheduling as a simple yet effective extension of curvature regularization for robust CAD reconstruction.

📄 PDF Abstract BibTeX arXiv:2511.03147

Code (0)

등록된 구현이 없습니다.

Tasks

CAD ReconstructionPoint Clouds

Similar Papers 제목 키워드 기반

FlatCAD: Fast Curvature Regularization of Neural SDFs for CAD Models

2025-06-19 · Haotian Yin, Aleksander Plocharski, Michal Jan Wlodarczyk, Mikolaj Kida 외

Neural signed-distance fields (SDFs) have become a versatile backbone for geometric learning, yet enforcing developable, CAD-style behavior still hinges on Gaussian curvature penalties that require full Hessian evaluatio…

GPU

Efficient Weingarten Map and Curvature Estimation on Manifolds

2019-05-26 · Yueqi Cao, Didong Li, Huafei Sun, Amir H Assadi 외

In this paper, we propose an efficient method to estimate the Weingarten map for point cloud data sampled from manifold embedded in Euclidean space. A statistical model is established to analyze the asymptotic property o…

Towards Better Gradient Consistency for Neural Signed Distance Functions via Level Set Alignment

2023-05-19 · CVPR 2023 1 · Baorui Ma, Junsheng Zhou, Yu-Shen Liu, Zhizhong Han

Neural signed distance functions (SDFs) have shown remarkable capability in representing geometry with details. However, without signed distance supervision, it is still a challenge to infer SDFs from point clouds or mul…

Geometric implicit neural representations for signed distance functions

2025-11-10 · Luiz Schirmer, Tiago Novello, Vinícius da Silva, Guilherme Schardong 외 arxiv

\textit{Implicit neural representations} (INRs) have emerged as a promising framework for representing signals in low-dimensional spaces. This survey reviews the existing literature on the specialized INR problem of appr…

3D ReconstructionPoint Clouds

Learning Compact Latent Space for Representing Neural Signed Distance Functions with High-fidelity Geometry Details

2025-11-18 · Qiang Bai, Bojian Wu, Xi Yang, Zhizhong Han arxiv

Neural signed distance functions (SDFs) have been a vital representation to represent 3D shapes or scenes with neural networks. An SDF is an implicit function that can query signed distances at specific coordinates for r…