paper-with-me

홈 › Papers

PointTriNet: Learned Triangulation of 3D Point Sets

2020-04-19 · ECCV 2020 8 · Nicholas Sharp, Maks Ovsjanikov

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.

📄 PDF Abstract BibTeX arXiv:2005.02138

Code (1)

nmwsharp/learned-triangulation 공식 구현 pytorch

Similar Papers 제목 키워드 기반

MGCN: Descriptor Learning using Multiscale GCNs

2020-01-28 · Yiqun Wang, Jing Ren, Dong-Ming Yan, Jianwei Guo 외

We propose a novel framework for computing descriptors for characterizing points on three-dimensional surfaces. First, we present a new non-learned feature that uses graph wavelets to decompose the Dirichlet energy on a …

Multi-View Optimization of Local Feature Geometry

2020-03-18 · ECCV 2020 8 · Mihai Dusmanu, Johannes L. Schönberger, Marc Pollefeys

In this work, we address the problem of refining the geometry of local image features from multiple views without known scene or camera geometry. Current approaches to local feature detection are inherently limited in th…

Camera Localization

The Minimum Spanning Tree of Maximum Entropy

2015-05-23 · Samuel de Sousa, Walter G. Kropatsch

In computer vision, we have the problem of creating graphs out of unstructured point-sets, i.e. the data graph. A common approach for this problem consists of building a triangulation which might not always lead to the b…

graph constructionGraph Matching

Affine invariant triangulations

2020-11-04 · Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira

We study affine invariant 2D triangulation methods. That is, methods that produce the same triangulation for a point set $S$ for any (unknown) affine transformation of $S$. Our work is based on a method by Nielson [A cha…

TriSearch: Learning to Optimize Triangulations via Bistellar Flips

2026-05-28 · Yiran Wang, Guido Montúfar arxiv

We introduce TriSearch, a reinforcement learning framework for optimizing objectives over triangulations of a polytope via bistellar flips. The key idea is a circuit-supported subtriangulation action representation: feas…

Reinforcement Learning