Building Construction Sets by Tiling Grammar Simplification

dc.contributor.authorKalojanov, Javoren_US
dc.contributor.authorWand, Michaelen_US
dc.contributor.authorSlusallek, Philippen_US
dc.contributor.editorJoaquim Jorge and Ming Linen_US
dc.date.accessioned2016-04-26T08:36:55Z
dc.date.available2016-04-26T08:36:55Z
dc.date.issued2016en_US
dc.description.abstractThis paper poses the problem of fabricating physical construction sets from example geometry: A construction set provides a small number of different types of building blocks from which the example model as well as many similar variants can be reassembled. This process is formalized by tiling grammars. Our core contribution is an approach for simplifying tiling grammars such that we obtain physically manufacturable building blocks of controllable granularity while retaining variability, i.e., the ability to construct many different, related shapes. Simplification is performed by sequences of two types of elementary operations: non-local joint edge collapses in the tile graphs reduce the granularity of the decomposition and approximate replacement operations reduce redundancy. We evaluate our method on abstract graph grammars in addition to computing several physical construction sets, which are manufactured using a commodity 3D printer.en_US
dc.description.number2en_US
dc.description.sectionheadersShape M&Men_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume35en_US
dc.identifier.doi10.1111/cgf.12807en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages013-025en_US
dc.identifier.urihttps://doi.org/10.1111/cgf.12807en_US
dc.publisherThe Eurographics Association and John Wiley & Sons Ltd.en_US
dc.subjectI.3.5 [Computer Graphics]en_US
dc.subjectComputational Geometry and Object Modelingen_US
dc.subjectGeometric algorithmsen_US
dc.subjectlanguagesen_US
dc.subjectand systemsen_US
dc.titleBuilding Construction Sets by Tiling Grammar Simplificationen_US
Files