Pith. sign in

REVIEW 1 cited by

SpaceMesh: A Continuous Representation for Learning Manifold Surface Meshes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.20562 v2 pith:N3DL5ZNQ submitted 2024-09-30 cs.CV cs.GRcs.LG

classification cs.CVcs.GRcs.LG
keywords meshesmeshlearningrepresentationconnectivitygeneratecontinuousdirectly
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Meshes are ubiquitous in visual computing and simulation, yet most existing machine learning techniques represent meshes only indirectly, e.g. as the level set of a scalar field or deformation of a template, or as a disordered triangle soup lacking local structure. This work presents a scheme to directly generate manifold, polygonal meshes of complex connectivity as the output of a neural network. Our key innovation is to define a continuous latent connectivity space at each mesh vertex, which implies the discrete mesh. In particular, our vertex embeddings generate cyclic neighbor relationships in a halfedge mesh representation, which gives a guarantee of edge-manifoldness and the ability to represent general polygonal meshes. This representation is well-suited to machine learning and stochastic optimization, without restriction on connectivity or topology. We first explore the basic properties of this representation, then use it to fit distributions of meshes from large datasets. The resulting models generate diverse meshes with tessellation structure learned from the dataset population, with concise details and high-quality mesh elements. In applications, this approach not only yields high-quality outputs from generative models, but also enables directly learning challenging geometry processing tasks such as mesh repair.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. DMesh++: An Efficient Differentiable Mesh for Complex Shapes

    cs.CV 2024-12 conditional novelty 6.0 of 10

    DMesh++ speeds up differentiable mesh generation by using a Minimum-Ball condition instead of weighted Delaunay triangulation, enabling faster reconstruction of complex shapes.

Pith tools