Morten Henkel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Morten Henkel has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Gregor Kobsik
Visual Computing Institute RWTH Aachen University Germany
1 shared publication - Isaak Lim
RWTH Aachen University Germany
1 shared publication - Leif Kobbelt
Visual Computing Institute, RWTH Aachen University, Aachen, Germany
1 shared publication - Tim Elsner
Visual Computing Institute RWTH Aachen University Germany
1 shared publication - Victor Czech
Visual Computing Institute RWTH Aachen University Germany
1 shared publication - Yan-Jiang He
Visual Computing Institute RWTH Aachen University Germany
1 shared publication
Latest Publications
- Open Access
- 25 April 2026
- Published by Wiley in Computer Graphics Forum
Self‐supervised Learning of Fine‐to‐Coarse Cuboid Shape Abstraction
The abstraction of 3D objects with simple geometric primitives like cuboids allows us to infer structural information from complex geometry. It is important for 3D shape understanding, structural analysis and geometric modeling. We introduce a novel fine‐to‐coarse self‐supervised learning approach to abstract collections of 3D shapes. Our architectural design allows us to reduce the number of primitives from hundreds (fine reconstruction) to only a few (coarse abstraction) during training. This allows our network to optimize the reconstruction error and adhere to a user‐specified number of primitives per shape while simultaneously learning a consistent structure across the whole collection of data. We achieve this through our abstraction loss formulation which increasingly penalizes redundant primitives. Furthermore, we introduce a reconstruction loss formulation to account not only for surface approximation but also volume preservation. Combining both contributions allows us to represent 3D shapes more precisely with fewer cuboid primitives than previous work. We evaluate our method on collections of man‐made and humanoid shapes comparing with previous state‐of‐the‐art learning methods on commonly used benchmarks. Our results confirm an improvement over previous cuboid‐based shape abstraction techniques. Furthermore, we demonstrate our cuboid abstraction in downstream tasks like clustering, retrieval, and partial symmetry detection.
- 25 April 2026
- Published by Wiley in Computer Graphics Forum
Open AccessSelf‐supervised Learning of Fine‐to‐Coarse Cuboid Shape Abstraction
The abstraction of 3D objects with simple geometric primitives like cuboids allows us to infer structural information from complex geometry. It is important for 3D shape understanding, structural analysis and geometric modeling. We introduce a novel fine‐to‐coarse self‐supervised learning approach to abstract collections of 3D shapes. Our architectural design allows us to reduce the number of primitives from hundreds (fine reconstruction) to only a few (coarse abstraction) during training. This allows our network to optimize the reconstruction error and adhere to a user‐specified number of primitives per shape while simultaneously learning a consistent structure across the whole collection of data. We achieve this through our abstraction loss formulation which increasingly penalizes redundant primitives. Furthermore, we introduce a reconstruction loss formulation to account not only for surface approximation but also volume preservation. Combining both contributions allows us to represent 3D shapes more precisely with fewer cuboid primitives than previous work. We evaluate our method on collections of man‐made and humanoid shapes comparing with previous state‐of‐the‐art learning methods on commonly used benchmarks. Our results confirm an improvement over previous cuboid‐based shape abstraction techniques. Furthermore, we demonstrate our cuboid abstraction in downstream tasks like clustering, retrieval, and partial symmetry detection.