Table of Contents
Fetching ...

PolyhedronNet: Representation Learning for Polyhedra with Surface-attributed Graph

Dazhou Yu, Genpei Zhang, Liang Zhao

TL;DR

PolyhedronNet tackles polyhedra representation learning by introducing the surface-attributed graph (SAG) to unify vertices, edges, and faces with semantic attributes. It then decomposes SAG into local rigid representations along two-hop paths to preserve geometric and semantic information while achieving rotation and translation invariance, and applies a specialized graph neural network, PolyhedronGNN, to hierarchically aggregate these local representations into a global SAG embedding. The framework is underpinned by invertibility and completeness notions for recovering the original polyhedron from SAG-derived representations, and demonstrates state-of-the-art performance on four datasets for classification and retrieval. This approach enables robust, surface-aware understanding of polyhedral shapes with potential impact on CAD, architectural design, and 3D object analysis by providing a principled, scalable representation learning pipeline.

Abstract

Ubiquitous geometric objects can be precisely and efficiently represented as polyhedra. The transformation of a polyhedron into a vector, known as polyhedra representation learning, is crucial for manipulating these shapes with mathematical and statistical tools for tasks like classification, clustering, and generation. Recent years have witnessed significant strides in this domain, yet most efforts focus on the vertex sequence of a polyhedron, neglecting the complex surface modeling crucial in real-world polyhedral objects. This study proposes \textbf{PolyhedronNet}, a general framework tailored for learning representations of 3D polyhedral objects. We propose the concept of the surface-attributed graph to seamlessly model the vertices, edges, faces, and their geometric interrelationships within a polyhedron. To effectively learn the representation of the entire surface-attributed graph, we first propose to break it down into local rigid representations to effectively learn each local region's relative positions against the remaining regions without geometric information loss. Subsequently, we propose PolyhedronGNN to hierarchically aggregate the local rigid representation via intra-face and inter-face geometric message passing modules, to obtain a global representation that minimizes information loss while maintaining rotation and translation invariance. Our experimental evaluations on four distinct datasets, encompassing both classification and retrieval tasks, substantiate PolyhedronNet's efficacy in capturing comprehensive and informative representations of 3D polyhedral objects. Code and data are available at {https://github.com/dyu62/3D_polyhedron}.

PolyhedronNet: Representation Learning for Polyhedra with Surface-attributed Graph

TL;DR

PolyhedronNet tackles polyhedra representation learning by introducing the surface-attributed graph (SAG) to unify vertices, edges, and faces with semantic attributes. It then decomposes SAG into local rigid representations along two-hop paths to preserve geometric and semantic information while achieving rotation and translation invariance, and applies a specialized graph neural network, PolyhedronGNN, to hierarchically aggregate these local representations into a global SAG embedding. The framework is underpinned by invertibility and completeness notions for recovering the original polyhedron from SAG-derived representations, and demonstrates state-of-the-art performance on four datasets for classification and retrieval. This approach enables robust, surface-aware understanding of polyhedral shapes with potential impact on CAD, architectural design, and 3D object analysis by providing a principled, scalable representation learning pipeline.

Abstract

Ubiquitous geometric objects can be precisely and efficiently represented as polyhedra. The transformation of a polyhedron into a vector, known as polyhedra representation learning, is crucial for manipulating these shapes with mathematical and statistical tools for tasks like classification, clustering, and generation. Recent years have witnessed significant strides in this domain, yet most efforts focus on the vertex sequence of a polyhedron, neglecting the complex surface modeling crucial in real-world polyhedral objects. This study proposes \textbf{PolyhedronNet}, a general framework tailored for learning representations of 3D polyhedral objects. We propose the concept of the surface-attributed graph to seamlessly model the vertices, edges, faces, and their geometric interrelationships within a polyhedron. To effectively learn the representation of the entire surface-attributed graph, we first propose to break it down into local rigid representations to effectively learn each local region's relative positions against the remaining regions without geometric information loss. Subsequently, we propose PolyhedronGNN to hierarchically aggregate the local rigid representation via intra-face and inter-face geometric message passing modules, to obtain a global representation that minimizes information loss while maintaining rotation and translation invariance. Our experimental evaluations on four distinct datasets, encompassing both classification and retrieval tasks, substantiate PolyhedronNet's efficacy in capturing comprehensive and informative representations of 3D polyhedral objects. Code and data are available at {https://github.com/dyu62/3D_polyhedron}.

Paper Structure

This paper contains 26 sections, 4 theorems, 7 equations, 6 figures, 7 tables.

Key Result

Lemma 4.2

Let $q=\{p_i\}_{i=1}^{N_f}$ be a polyhedron and ${G} = (V, E, F, a)$ be the SAG derived from ${q}$. The transformation from ${q}$ to ${G}$ is invertible.

Figures (6)

  • Figure 1: 3D objects modeled as polyhedra.
  • Figure 2: Illustration of the proposed framework.
  • Figure 3: Hyperparameter sensitivity
  • Figure 4: Test cases from the MNIST-C dataset correctly predicted by PolyhedronNet, displaying face-attributed and blank versions side by side. The blank models are rotated to show the possible ambiguity. Predictions from comparison methods are also presented below each image for comparison.
  • Figure 5: Test cases from the ShapeNet-P dataset correctly predicted by PolyhedronNet, displaying face-attributed and blank versions side by side. Predictions from comparison methods are also presented below each image for comparison.
  • ...and 1 more figures

Theorems & Definitions (16)

  • Definition 3.1: Polygon
  • Definition 3.2: Polyhedron
  • Definition 4.1: Surface-attributed graph
  • Lemma 4.2
  • proof
  • Definition 4.3: Two-hop Path
  • Definition 4.4: Local Rigid Representation of SAG
  • Theorem 4.5
  • proof
  • Theorem 4.6
  • ...and 6 more