지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
이용수
초록· 키워드
오류제보하기
To raise the industrial competitiveness in the field of ship-building, it is crucially important that the yard should use production facilities and working space effectively. Among the related works, the management of tremendous blocks’ number, the limited area of assembly shops and inefficient personnel and facility management still need to be improved in terms of being exposed to a lot of problems. To settle down these conundrums, the various strategies of block arrangement on the assembly floors have been recently presented and in the results, have increasingly began to be utilized in practice. However, it is a wonder that the sampled or approximated block shapes which usually are standardized projections or the geometrically convex contour only have been prevailed until now. In this study, all parts including the panel, stiffeners, outer shells, and all kinds of outfitting equipment are first extracted using the Volume Primitive plug-in module from the ship customized CAD system and then, the presented system constructs a simpler and more compact ship data structure and finally generates the novel projected contours for the block arrangement system using the adaptive concave hull algorithm.
목차
1. 서론
2. 간략 형상 정보 추출과 경량화
3. 오목형상 추출 알고리즘
4. 정반 배치용 블록 투영형상 적용 예
5. 결론
References
참고문헌 (19)
참고문헌 신청
1. [학술대회논문] - Beyer, K. / 1999 / When is “nearest neighbor” meaningful? / ICDT ’99 International conference on Database Theory : 246 ~ 251
2. [학술지(정기간행물)] - Devroye, L. / 1981 / A Note on Linear Expected Time Algorithm for Finding Convex Hulls / Computing 26 : 361 ~ 366
3. [학술대회논문] - Galton, A. / 2006 / What is the region occupied by a set of points? / Proceedings of the 4th International Conference on Geographic Information Science : 81 ~ 98
4. [학술대회논문] - Moreira, A / 2007 / Concave hull: A k-nearest neighbors approach for the computation of the region occupied by a set of points / Proceedings of International Conference on Computer Graphics Theory and Applications : 61 ~ 68
5. [인터넷자원] - HOOPS Exchange / / User Manual
2. [학술지(정기간행물)] - Devroye, L. / 1981 / A Note on Linear Expected Time Algorithm for Finding Convex Hulls / Computing 26 : 361 ~ 366
3. [학술대회논문] - Galton, A. / 2006 / What is the region occupied by a set of points? / Proceedings of the 4th International Conference on Geographic Information Science : 81 ~ 98
4. [학술대회논문] - Moreira, A / 2007 / Concave hull: A k-nearest neighbors approach for the computation of the region occupied by a set of points / Proceedings of International Conference on Computer Graphics Theory and Applications : 61 ~ 68
5. [인터넷자원] - HOOPS Exchange / / User Manual
이 논문의 저자 정보
이 논문과 함께 이용한 논문
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2015-550-001711604