CVGRDec 2, 2020

Learning Delaunay Surface Elements for Mesh Reconstruction

arXiv:2012.01203v250 citationsHas Code
AI Analysis

This work provides a method for improving the manifoldness of reconstructed meshes, which is a significant problem for applications requiring high-quality 3D models.

This paper addresses the challenge of reconstructing manifold triangle meshes from point clouds, a common issue with existing learning-based methods that generate triangles individually. The authors propose a method that estimates local geodesic neighborhoods, projects them to 2D using a learned logarithmic map, and then applies Delaunay triangulation to create manifold surface elements. This approach results in reconstructed meshes with better overall manifoldness compared to current methods.

We present a method for reconstructing triangle meshes from point clouds. Existing learning-based methods for mesh reconstruction mostly generate triangles individually, making it hard to create manifold meshes. We leverage the properties of 2D Delaunay triangulations to construct a mesh from manifold surface elements. Our method first estimates local geodesic neighborhoods around each point. We then perform a 2D projection of these neighborhoods using a learned logarithmic map. A Delaunay triangulation in this 2D domain is guaranteed to produce a manifold patch, which we call a Delaunay surface element. We synchronize the local 2D projections of neighboring elements to maximize the manifoldness of the reconstructed mesh. Our results show that we achieve better overall manifoldness of our reconstructed meshes than current methods to reconstruct meshes with arbitrary topology. Our code, data and pretrained models can be found online: https://github.com/mrakotosaon/dse-meshing

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes