2021
DOI: 10.48550/arxiv.2106.05779
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Deep Implicit Surface Point Prediction Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…However they have several major limitations: 1) learning UDF is a regression problem, harder than that in SDF; 2) ball pivoting [3] is more computational expensive and less stable than Marching Cubes [25]; 3) gradient vanishes on the surface, resulting in artifacts. Venkatesh et al [39] proposed Closest Surface-Point (CSP) representation to prevent gradient vanishing and improve the speed. Zhao et al [45] proposed Anchor UDF to improve reconstruction accuracy.…”
Section: Implicit Function Learningmentioning
confidence: 99%
See 1 more Smart Citation
“…However they have several major limitations: 1) learning UDF is a regression problem, harder than that in SDF; 2) ball pivoting [3] is more computational expensive and less stable than Marching Cubes [25]; 3) gradient vanishes on the surface, resulting in artifacts. Venkatesh et al [39] proposed Closest Surface-Point (CSP) representation to prevent gradient vanishing and improve the speed. Zhao et al [45] proposed Anchor UDF to improve reconstruction accuracy.…”
Section: Implicit Function Learningmentioning
confidence: 99%
“…However, they can only model closed surfaces that support the in/out test for level surface extraction. Recent advances that leverage unsigned distance function (UDF) [10,39,40] have made it possible to learn open surfaces from point clouds. But instantiating this field into an explicit mesh remains cumbersome and is prone to artifacts.…”
Section: Introductionmentioning
confidence: 99%