Pith. sign in

REVIEW 1 cited by

UV-Net: Learning from Boundary Representations

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 2006.10211 v2 pith:A7C63FQL submitted 2020-06-18 cs.CV cs.LG

classification cs.CVcs.LG
keywords b-repdatauv-netrepresentationarchitectureboundarydesignedentities
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We introduce UV-Net, a novel neural network architecture and representation designed to operate directly on Boundary representation (B-rep) data from 3D CAD models. The B-rep format is widely used in the design, simulation and manufacturing industries to enable sophisticated and precise CAD modeling operations. However, B-rep data presents some unique challenges when used with modern machine learning due to the complexity of the data structure and its support for both continuous non-Euclidean geometric entities and discrete topological entities. In this paper, we propose a unified representation for B-rep data that exploits the U and V parameter domain of curves and surfaces to model geometry, and an adjacency graph to explicitly model topology. This leads to a unique and efficient network architecture, UV-Net, that couples image and graph convolutional neural networks in a compute and memory-efficient manner. To aid in future research we present a synthetic labelled B-rep dataset, SolidLetters, derived from human designed fonts with variations in both geometry and topology. Finally we demonstrate that UV-Net can generalize to supervised and unsupervised tasks on five datasets, while outperforming alternate 3D shape representations such as point clouds, voxels, and meshes.

Discussion (0). Sign in 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. GraphBrep: Learning B-Rep in Graph Structure for Efficient CAD Generation

    cs.CV 2025-07 conditional novelty 6.0 of 10

    GraphBrep replaces the redundant tree-based topology of prior B-Rep generators with an explicit graph adjacency representation, cutting training and inference cost while preserving generation quality.

Pith tools