Patchwork: A compact representation for 3D polygonal shapes
Patchwork is a general-purpose geometric representation built to model 2D and 3D shapes with a small parameter count. The paper says it comes with a rigorous mathematical framework, provable complexity bounds, and the ability to approximate arbitrary shapes in any dimension to arbitrary precision. That makes it more than just another neural shape encoding: the authors are explicitly trying to balance expressiveness, compactness, and theoretical guarantees.
For developers, the practical angle is the fitting pipeline. They propose a gradient-based optimization method plus a regularization loss that progressively removes redundant elements, so the representation becomes more compact after training instead of bloating with unused parts. The paper also calls out native inside-outside classification, which is handy for reconstruction, collision-style queries, and any workflow that needs a clear notion of solid vs. empty space. The implementation is reportedly available, and the work was...
“a small number of parameters”
- what
- Patchwork is a new compact representation for 2D and 3D polygonal shapes with arbitrary-precision approximation claims.
- who
- Authors are Ruichen Zheng, Biao Zhang, Michael Birsak, Mikhail Skopenkov, and Peter Wonka.
- when
- Submitted to arXiv on 24 Mar 2026; arXiv ID 2605.16266.
- impact
- Could reduce parameter counts for learned shape fitting, reconstruction, and future 3D generation pipelines.
Promising technical advance with clear production-relevant benefits
Follow graphics updates
See relevant stories in your personalized news feed.
Discussion