Algorithm for computing the circle set Voronoi diagram using edge-flip operations
(주)코리아스칼라
- 최초 등록일
- 2023.04.05
- 최종 저작일
- 2002.10
- 6페이지/ 어도비 PDF
- 가격 4,000원
* 본 문서는 배포용으로 복사 및 편집이 불가합니다.
서지정보
ㆍ발행기관 : 한국산업경영시스템학회
ㆍ수록지정보 : 한국산업경영시스템학회 학술대회
ㆍ저자명 : Deok-Soo Kim, Donguk Kim, Kwangseok Yu, Junghun Lim, Dong-Soo Cho, Kokichi Sugihara
목차
Abstract
1. Introduction
2. Preliminaries
3. Topology update
4. Geometry update
5. Implementation and examples
6. Conclusions
Acknowledgements
References
영어 초록
Presented in this paper is an algorithm to compute the Voronoi diagram of a circle set from the Voronoi diagram of a point set. The circles are located in Euclidean plane, the radii of the circles are non-negative and not necessarily equal, and the circles are allowed to intersect each other. The idea of the algorithm is to use the topology of the point set Voronoi diagram as a seed so that the correct topology of the circle set Voronoi diagram can be obtained through a number of edge flipping operations. Then, the geometries of the Voronoi edges of the circle set Voronoi diagram are computed. The main advantages of the proposed algorithm are in its robustness, speed, and the simplicity in its concept as well as implementation.
참고 자료
없음
"한국산업경영시스템학회 학술대회"의 다른 논문
더보기 (5/10)