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

추천
검색
질문

이용수

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

초록· 키워드

오류제보하기
An offset edge algorithm is a common method of creating contour-parallel paths that has been widely studied. The method includes approaches such as pair-wise inlersection and Voronoi diagrams. The method proposed in this paper is unlike these approaches in that it determines an offset algorithm via the offset vertex. In addition, the proposed method differs from common approaches because: (1) the ofset vertices are computed based on bisector, (2) the validity of combining the direction and position checking for each offset edge is the main point of the proposed method: (3) an efficient algorithm is constructed to connect all offset edges simultaneously to generate raw offset lines without local invalid loops, and (4) an offset-distance check is performed to remove the global invalid loops from the raw offset lines as well as the interference loops in joining boundaries and multiple islands. The proposed method was verified with various slice contour shapes, with or without islands, and good results were obtained with significant reductions in the calculation time.

목차

1. Introduction
2. Generating Offset Loops
3. Joining Boundaries and Islands
4. Implementation and Results
5. Conclusions and Future Work
REFERENCES

참고문헌 (17)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0