상세 보기
Farthest-polygon voronoi diagrams
- Cheong, O.;
- Everett, H.;
- Glisse, M.;
- Gudmundsson, J.;
- Hornus, S.;
- ... Na, H.-S.;
- 외 2명
초록
Given a family of k disjoint connected polygonal sites of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest point on it. We show that the complexity of this diagram is O(n), and give an O(n log3 n) time algorithm to compute it. © Springer-Verlag Berlin Heidelberg 2007.
- 제목
- Farthest-polygon voronoi diagrams
- 저자
- Cheong, O.; Everett, H.; Glisse, M.; Gudmundsson, J.; Hornus, S.; Lazard, S.; Lee, M.; Na, H.-S.
- 발행일
- 2007
- 학회명
- 15th Annual European Symposium on Algorithms, ESA 2007
- 개최지
- Eilat
- 학회 개최일
- 2007-10-08 ~ 2007-10-10