Pith. sign in

REVIEW 4 cited by

Neural Subdivision

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 2005.01819 v1 pith:T3S75OA7 submitted 2020-05-04 cs.GR cs.LG

Neural Subdivision

classification cs.GR cs.LG
keywords meshsubdivisiongeometrymethodnetworkduringlocalneural
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

This paper introduces Neural Subdivision, a novel framework for data-driven coarse-to-fine geometry modeling. During inference, our method takes a coarse triangle mesh as input and recursively subdivides it to a finer geometry by applying the fixed topological updates of Loop Subdivision, but predicting vertex positions using a neural network conditioned on the local geometry of a patch. This approach enables us to learn complex non-linear subdivision schemes, beyond simple linear averaging used in classical techniques. One of our key contributions is a novel self-supervised training setup that only requires a set of high-resolution meshes for learning network weights. For any training shape, we stochastically generate diverse low-resolution discretizations of coarse counterparts, while maintaining a bijective mapping that prescribes the exact target position of every new vertex during the subdivision process. This leads to a very efficient and accurate loss function for conditional mesh generation, and enables us to train a method that generalizes across discretizations and favors preserving the manifold structure of the output. During training we optimize for the same set of network weights across all local mesh patches, thus providing an architecture that is not constrained to a specific input mesh, fixed genus, or category. Our network encodes patch geometry in a local frame in a rotation- and translation-invariant manner. Jointly, these design choices enable our method to generalize well, and we demonstrate that even when trained on a single high-resolution mesh our method generates reasonable subdivisions for novel shapes.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

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

  1. MeshFIM: Local Low-Poly Mesh Editing via Fill-in-the-Middle Autoregressive Generation

    cs.GR 2026-05 unverdicted novelty 7.0

    MeshFIM enables local low-poly mesh editing by autoregressively filling target regions conditioned on context, using boundary markers, positional embeddings, and a gated geometry encoder to enforce attachment, topolog...

  2. SubdivAR: Autoregressive Next-Scale Prediction for Neural Mesh Subdivision

    cs.CV 2026-06 unverdicted novelty 6.0

    SubdivAR reformulates neural mesh subdivision as autoregressive next-scale coordinate prediction with a topology-aware transformer and reports 18.8% and 14.2% reductions in Hausdorff and Chamfer distance over baseline...

  3. SubdivAR: Autoregressive Next-Scale Prediction for Neural Mesh Subdivision

    cs.CV 2026-06 conditional novelty 6.0

    SubdivAR reformulates neural mesh subdivision as autoregressive next-scale vertex-offset prediction, reporting 18.8% lower Hausdorff and 14.2% lower Chamfer distance than NMR on closed meshes.

  4. Blended Chart Surfaces: A Seamless Explicit Representation for Smooth Surface Fitting

    cs.GR 2026-06 unverdicted novelty 6.0

    Blended Chart Surfaces create a compact explicit globally smooth surface by optimizing per-vertex polynomial maps on a proxy mesh and blending them via one-ring coordinates.