Premium
Replaceable Substructures for Efficient Part‐Based Modeling
Author(s) -
Liu Han,
Vimont Ulysse,
Wand Michael,
Cani MariePaule,
Hahmann Stefanie,
Rohmer Damien,
Mitra Niloy J.
Publication year - 2015
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/cgf.12579
Subject(s) - computer science , consistency (knowledge bases) , boundary (topology) , theoretical computer science , matching (statistics) , key (lock) , topology (electrical circuits) , algorithm , mathematics , artificial intelligence , combinatorics , mathematical analysis , statistics , computer security
A popular mode of shape synthesis involves mixing and matching parts from different objects to form a coherent whole. The key challenge is to efficiently synthesize shape variations that are plausible, both locally and globally. A major obstacle is to assemble the objects with local consistency, i.e., all the connections between parts are valid with no dangling open connections. The combinatorial complexity of this problem limits existing methods in geometric and/or topological variations of the synthesized models. In this work, we introduce replaceable substructures as arrangements of parts that can be interchanged while ensuring boundary consistency. The consistency information is extracted from part labels and connections in the original source models. We present a polynomial time algorithm that discovers such substructures by working on a dual of the original shape graph that encodes inter‐part connectivity. We demonstrate the algorithm on a range of test examples producing plausible shape variations, both from a geometric and from a topological viewpoint.