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

PointTriNet: Learned Triangulation of 3D Point Sets

Nicholas Sharp,
Maks Ovsjanikov

Abstract: 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 to generate a triangulation: a classification network predicts whether a candidate triangle should appear in the triangulation, while a proposal network suggests additional candidates. Both networks are structu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(5 citation statements)
references
References 31 publications
0
5
0
Order By: Relevance
“…Scan2Mesh [13] learns to explicitly generate vertices, edges and faces using graph neural networks. PointTriNet [33] explicitly learns the triangulation of a given point set to form the mesh.…”
Section: Related Workmentioning
confidence: 99%
“…Scan2Mesh [13] learns to explicitly generate vertices, edges and faces using graph neural networks. PointTriNet [33] explicitly learns the triangulation of a given point set to form the mesh.…”
Section: Related Workmentioning
confidence: 99%
“…Most closely related to ours are two very recent approaches aimed directly to address the point set triangulation problem. The first method PointTriNet [41] works on point clouds and, similarly to ours, uses a local patchbased network for predicting connectivity. However, this technique processes triangles independently and only promotes watertight and manifold structure through soft penalties.…”
Section: Learning Mesh Connectivitymentioning
confidence: 99%
“…In contrast to both of these approaches [41,33], we formulate the meshing problem as learning of (local) Delaunay triangulations. Starting from the restricted Voronoi diagram based formulation proposed in [10] we use data-driven priors to directly learn local projections to create local Delaunay patches.…”
Section: Learning Mesh Connectivitymentioning
confidence: 99%
See 2 more Smart Citations