Title: Survey on Automated LEGO Assembly Construction
Authors: Kim, Jae Woo
Kang, Kyung Kyu
Lee, Ji Hyoung
Citation: WSCG 2014: Poster Papers Proceedings: 22nd International Conference in Central Europeon Computer Graphics, Visualization and Computer Vision in co-operation with EUROGRAPHICS Association, p. 89-96.
Issue Date: 2014
Publisher: Václav Skala - UNION Agency
Document type: konferenční příspěvek
URI: http://wscg.zcu.cz/WSCG2014/!!_2014-Posters-Proceedings.pdf
ISBN: 978-80-86943-72-5
Keywords: 3D modely;polygonální mřížky;evoluční algoritmy;LEGO konstrukce
Keywords in different language: 3D models;polygonal meshes;evolutionary algorithms;LEGO constructions
Abstract: LEGO has been very popular toy in the world because it is attractive and fun to play with and stimulates one's creativity by providing means to conveniently assemble a variety of interesting shapes using the limited types of given bricks. However, it is hard for the beginners to design and assemble complex models they desire to make without instructions. Building a LEGO assembly manually usually requires a significant amount of trial-anderror. LEGO company therefore presented the LEGO construction problem in 1998 and in 2001. The problem statement is "Given any 3D body, how can it be built from LEGO bricks?" In this paper we will investigate the current research efforts to address the LEGO construction problem. We will review the problem definition, formulation, and a variety of approaches to solve the problem. We will discuss the data representations for input 3D polygonal models and the LEGO assembly structures, cost functions that will guide the search for the optimal solution, and various solution methods.
Rights: © Václav Skala - Union Agency
Appears in Collections:WSCG 2014: Poster Papers Proceedings

Files in This Item:
File Description SizeFormat 
Kim.pdfPlný text800,09 kBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/11949

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.