메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

논문 기본 정보

자료유형
학술저널
저자정보
CHOHONGMIN (Ewha womans university)
저널정보
한국산업응용수학회 JOURNAL OF THE KOREAN SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS Journal of the Korean Society for Industrial and Applied Mathematics Vol.15 No.4
발행연도
2011.12
수록면
307 - 318 (12page)

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
We introduce an algorithm that automatically generates paper templates of a triangulated surface. The surface can be built by cutting, folding, and pasting the paper templates. The algorithm is branched to two strategies : one is to select the longest neighboring edge among many choices, and the other is to select the largest neighboring triangle. Three surfaces, whose triangulation sizes widely range, are successfully built by the algorithm. The two strategies are empirically evaluated in building the surfaces with respect to paper consumption, a measure of cost efficiency, and boundary length, a measure of speed efficiency. Strategy 1 performs in most cases better than the other one with respect to boundary length, but sometimes wins and sometimes loses with respect to paper consumption.

목차

Abstract
1. INTRODUCTION
2. ALGORITHM
3. EXAMPLES
4. CONCLUSION
ACKNOWLEDGEMENT
REFERENCES

참고문헌 (13)

참고문헌 신청

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-ECN-0101-2013-410-001374033