PointTriNet: Learned Triangulation of 3D Point Sets

被引:21
作者
Sharp, Nicholas [1 ]
Ovsjanikov, Maks [2 ]
机构
[1] Carnegie Mellon Univ, Pittsburgh, PA 15213 USA
[2] IP Paris, Ecole Polytech, LIX, Palaiseau, France
来源
COMPUTER VISION - ECCV 2020, PT XXIII | 2020年 / 12368卷
关键词
Geometric learning; Triangulation; Geometry processing; SURFACE RECONSTRUCTION;
D O I
10.1007/978-3-030-58592-1_45
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This work considers a new task in geometric deep learning: generating a triangulation among a set of points in 3D space. We present PointTriNet, a differentiable and scalable approach enabling point set triangulation as a layer in 3D learning pipelines. The method iteratively applies two neural networks: a classification network predicts whether a candidate triangle should appear in the triangulation, while a proposal network suggests additional candidates. Both networks are structured as PointNets over nearby points and triangles, using a novel triangle-relative input encoding. Since these learning problems operate on local geometric data, our method is efficient and scalable, and generalizes to unseen shape categories. Our networks are trained in an unsupervised manner from a collection of shapes represented as point clouds. We demonstrate the effectiveness of this approach for classical meshing tasks, robustness to outliers, and as a component in end-to-end learning systems.
引用
收藏
页码:762 / 778
页数:17
相关论文
共 48 条
[1]  
Achlioptas P, 2018, Arxiv, DOI arXiv:1707.02392
[2]  
Amenta N., 1998, Computer Graphics. Proceedings. SIGGRAPH 98 Conference Proceedings, P415, DOI 10.1145/280814.280947
[3]   Surface reconstruction by Voronoi filtering [J].
Amenta, N ;
Bern, M .
DISCRETE & COMPUTATIONAL GEOMETRY, 1999, 22 (04) :481-504
[4]   The power crust, unions of balls, and the medial axis transform [J].
Amenta, N ;
Choi, SH ;
Kolluri, RK .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2001, 19 (2-3) :127-153
[5]  
[Anonymous], 1992, Surface reconstruction from unorganized points
[6]   On triangulating three-dimensional polygons [J].
Barequet, G ;
Dickerson, M ;
Eppstein, D .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1998, 10 (03) :155-170
[7]   A Survey of Surface Reconstruction from Point Clouds [J].
Berger, Matthew ;
Tagliasacchi, Andrea ;
Seversky, Lee M. ;
Alliez, Pierre ;
Guennebaud, Gael ;
Levine, Joshua A. ;
Sharf, Andrei ;
Silva, Claudio T. .
COMPUTER GRAPHICS FORUM, 2017, 36 (01) :301-329
[8]   The ball-pivoting algorithm for surface reconstruction [J].
Bernardini, F ;
Mittleman, J ;
Rushmeier, H ;
Silva, C ;
Taubin, G .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 1999, 5 (04) :349-359
[9]   Reconstructing polygons from scanner data [J].
Biedl, Therese ;
Durocher, Stephane ;
Snoeyink, Jack .
THEORETICAL COMPUTER SCIENCE, 2011, 412 (32) :4161-4172
[10]   Provably good sampling and meshing of surfaces [J].
Boissonnat, JD ;
Oudot, S .
GRAPHICAL MODELS, 2005, 67 (05) :405-451