Physically feasible decomposition of Engino{\circledR} toy models: a graph-theoretic approach

DOI10.1017/S0956792518000086MaRDI QIDQ5205827zbMATH OpenOpenAlexFDO

Authors

Publication date 16 December 2019

Published in European Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1707.09040

zbMATH Keywords

modeling

Mathematics Subject Classification ID

Applications of graph theory (05C90)

Abstract: During the 125th European Study Group with Industry held in Limassol, Cyprus, 5-9 December 2016, one of the participating companies, Engino.net Ltd, posed a very interesting challenge to the members of the study group. Engino.net Ltd is a Cypriot company, founded in 2004, that produces a series of toy sets -- the Engino${}^{circledR}$ toy sets -- consisting of a number of building blocks which can be assembled by pupils to compose toy models. Depending on the contents of a particular toy set, the company has developed a number of models that can be built utilizing the blocks present in the set, however the production of a step-by-step assembly manual for each model could only be done manually. The goal of the challenge posed by the company was to implement a procedure to automatically generate the assembly instructions for a given toy. In the present paper we propose a graph-theoretic approach to model the problem and provide a series of results to solve it by employing modified versions of well established algorithms in graph theory. An algorithmic procedure to obtain a hierarchical, physically feasible decomposition of a given toy model, from which the assembly instructions can be recovered, is proposed.

Recommendations

• scientific article; zbMATH DE number 3936905
• Models and algorithms for optimising two-dimensional LEGO constructions
• Proceedings of the 84th European Study Group Mathematics with Industry, SWI 2012, Eindhoven, Netherlands, January 30--February 3, 2012
• scientific article; zbMATH DE number 4174378
• Graph-based modelling in engineering

Cites work

• A strong-connectivity algorithm and its applications in data flow analysis
• Depth-First Search and Linear Graph Algorithms
• Digraphs
• Disassembly sequencing: A survey
• Graph theory with applications
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• Objects that cannot be taken apart with two hands

Cited in

(1)

• Acyclic digraphs

This page was built for publication: Physically feasible decomposition of Engino{\circledR} toy models: a graph-theoretic approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5205827)