Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö ¼ÒÇÁÆ®¿þ¾î ¹× µ¥ÀÌÅÍ °øÇÐ
ÇѱÛÁ¦¸ñ(Korean Title) |
ÇϵÓÀ» ÀÌ¿ëÇÑ 3D ÇÁ¸°ÅÍ¿ë ´ë¿ë·® µ¥ÀÌÅÍ Ã³¸® ÀÀ¿ë °³¹ß |
¿µ¹®Á¦¸ñ(English Title) |
Development of Application to Deal with Large Data Using Hadoop for 3D Printer |
ÀúÀÚ(Author) |
ÃÖº´±â
ÀÌÁ¾¿í
¹Ú¼º±â
ÀÌÀçÈ£
Byunggi Choi
Jonguk Lee
Sunggi Park
Jaeho Lee
ÀÌ°Àº
±è¼º¼®
Kang Eun Lee
Sungsuk Kim
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 09 NO. 01 PP. 0011 ~ 0016 (2020. 01) |
Çѱ۳»¿ë (Korean Abstract) |
3D ÇÁ¸°ÆÃÀº ÁÖ¸ñ¹Þ´Â ½Å±â¼úÀÇ Çϳª·Î ¸¹Àº °ü½ÉÀ» ¹Þ°í ÀÖ´Ù. 3D ÇÁ¸°ÆÃÀ» Çϱâ À§Çؼ´Â ¸ÕÀú 3D ¸ðµ¨À» »ý¼ºÇÑ ÈÄ, À̸¦ ÇÁ¸°ÅÍ°¡ ÀνÄÇÒ ¼ö ÀÖ´Â G-code·Î º¯È¯ÇÏ¿©¾ß ÇÑ´Ù. ´ë°³ 3D ¸ðµ¨Àº ÆäÀ̼ÂÀ̶ó°í ÇÏ´Â Á¶±×¸¸ »ï°¢ÇüÀ¸·Î ¸éÀ» Ç¥ÇöÇϴµ¥, ¸ðµ¨ÀÇ Å©±â³ª Á¤¹Ðµµ¿¡ µû¶ó ÆäÀ̼ÂÀÇ °³¼ö°¡ ¸Å¿ì ¸¹¾ÆÁ®¼ º¯È¯¿¡ ¸¹Àº ½Ã°£ÀÌ °É¸®°Ô µÈ´Ù. ¾ÆÆÄÄ¡ ÇϵÓÀº ´ë¿ë·® µ¥ÀÌÅÍÀÇ ºÐ»ê󸮸¦ Áö¿øÇÏ´Â ÇÁ·¹ÀÓ¿öÅ©·Î¼ ±× È°¿ë ¹üÀ§°¡ ³Ð¾îÁö°í ÀÖ´Ù. º» ³í¹®¿¡¼´Â 3D ¸ðµ¨À» G-code·Î º¯È¯ÇÏ´Â ÀÛ¾÷À» È¿À²ÀûÀ¸·Î ¼öÇàÇϱâ À§ÇØ ÇϵÓÀ» È°¿ëÇÏ°íÀÚ ÇÑ´Ù. À̸¦ À§ÇØ 2´Ü°èÀÇ ºÐ»ê ¾Ë°í¸®ÁòÀ» °³¹ßÇÏ¿´´Ù. ÀÌ ¾Ë°í¸®ÁòÀº ¿©·¯ ÆäÀ̼µéÀ» ¸ÕÀú ZÃà °ªÀ¸·Î Á¤·ÄÇÑ ÈÄ, NµîºÐÇÏ¿© ¿©·¯ ³ëµå¿¡¼ µ¶¸³ÀûÀ¸·Î ºÐ»êó¸®Çϵµ·Ï µÇ¾î ÀÖ´Ù. ½ÇÁ¦ ºÐ»ê󸮴 Àüó¸® - ÇϵÓÀÇ Map – Shuffling – ReduceÀÇ 4 ´Ü°è¸¦ °ÅÃÄ ±¸ÇöµÇ¾ú´Ù. ÃÖÁ¾ÀûÀ¸·Î ¼º´É Æò°¡¸¦ À§ÇØ Å×½ºÆ®¿ë 3D ¸ðµ¨ÀÇ Å©±â¿Í Á¤¹Ðµµ¿¡ µû¸¥ ó¸® ½Ã°£ÀÇ È¿À²¼ºÀ» º¸¿´´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
3D printing is one of the emerging technologies and getting a lot of attention. To do 3D printing, 3D model is first generated, and then converted to G-code which is 3D printer¡¯s operations. Facet, which is a small triangle, represents a small surface of 3D model. Depending on the height or precision of the 3D model, the number of facets becomes very large and so the conversion time from 3D model to G-code takes longer. Apach Hadoop is a software framework to support distributed processing for large data set and its application range gets widening. In this paper, Hadoop is used to do the conversion works time-efficient way. 2-phase distributed algorithm is developed first. In the algorithm, all facets are sorted according to its lowest Z-value, divided into N parts, and converted on several nodes independently. The algorithm is implemented in four steps; preprocessing – Map – Shuffling - Reduce of Hadoop. Finally, to show the performance evaluation, Hadoop systems are set up and converts testing 3D model while changing the height or precision.
|
Å°¿öµå(Keyword) |
Service Robot
Cloud Interface
Model-based Interf
¼ºñ½º ·Îº¿
Ŭ¶ó¿ìµå ÀÎÅÍÆäÀ̽º
¸ðµ¨ ±â¹Ý ÀÎÅÍÆäÀ̽º
Large Data Processing
3D Printing
G-code
Hadoop
Facet
´ë¿ë·® µ¥ÀÌÅÍ Ã³¸®
3D ÇÁ¸°ÆÃ
G-code
ÇϵÓ
ÆäÀ̼Â
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|