Pith. sign in

REVIEW 1 cited by

On the Effectiveness of Weight-Encoded Neural Implicit 3D Shapes

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 2009.09808 v3 pith:YANBAP5H submitted 2020-09-17 cs.GR cs.CGcs.CV

classification cs.GRcs.CGcs.CV
keywords neuralshapeweight-encodedimplicitsrepresentationaccuracyimplicitreconstruction
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A neural implicit outputs a number indicating whether the given query point in space is inside, outside, or on a surface. Many prior works have focused on _latent-encoded_ neural implicits, where a latent vector encoding of a specific shape is also fed as input. While affording latent-space interpolation, this comes at the cost of reconstruction accuracy for any _single_ shape. Training a specific network for each 3D shape, a _weight-encoded_ neural implicit may forgo the latent vector and focus reconstruction accuracy on the details of a single shape. While previously considered as an intermediary representation for 3D scanning tasks or as a toy-problem leading up to latent-encoding tasks, weight-encoded neural implicits have not yet been taken seriously as a 3D shape representation. In this paper, we establish that weight-encoded neural implicits meet the criteria of a first-class 3D shape representation. We introduce a suite of technical contributions to improve reconstruction accuracy, convergence, and robustness when learning the signed distance field induced by a polygonal mesh -- the _de facto_ standard representation. Viewed as a lossy compression, our conversion outperforms standard techniques from geometry processing. Compared to previous latent- and weight-encoded neural implicits we demonstrate superior robustness, scalability, and performance.

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. Manifold-Guided Motion Planning for Tight Assemblies

    cs.RO 2026-07 reject novelty 6.0 of 10

    A sampling-based planner that biases samples toward near-contact configurations solves previously unsolved tight assembly puzzles and is claimed to be probabilistically complete.

Pith tools