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

추천
검색

논문 기본 정보

자료유형
학술저널
저자정보
조청운 (동서대학교)
저널정보
한국컴퓨터게임학회 한국컴퓨터게임학회논문지 한국컴퓨터게임학회논문지 제36권 제2호
발행연도
2023.6
수록면
61 - 69 (9page)

이용수

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

초록· 키워드

오류제보하기
Implementing a Voronoi diagram for a set of points on a two-dimensional plane is a technique very often used for non-realistic or stylized rendering. However, looking at implementation methods of existing studies, a method of calculating Voronoi cells in a pixel-based image space is used. The implementation of the vector-based Voronoi diagram is a method that can directly express the boundary where cells meet. In the case of the pixel-based method, the boundary between Voronoi cells can be obtained through edge extraction image processing after first making it in the form of an image, and the accuracy is determined by the resolution, which is inevitably less accurate than the vector-based method. That is, the pixel-based Voronoi diagram generation method mainly calculates the Voronoi cell area and does not explicitly have data on clear boundaries. In contrast, the vector-based Voronoi diagram generation method can be said to be a highly accurate expression method because it directly includes the boundary line data of the Voronoi diagram. However, because the pixel-based implementation method is a more intuitive and easy implementation method, existing studies are using the pixel-based implementation method. In this study, we propose a method for calculating Voronoi diagrams in 3D space using polygon geometry directly at points. Both the Euclidean distance and the Manhattan distance can be used, and it is proposed to be used for the extension of the Voronoi diagram for line segments.

목차

등록된 정보가 없습니다.

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

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

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0