Journal of KIISE:Computer Systems and Theory (한국정보과학회논문지:시스템및이론)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Algorithms for Computing k-centers on the Line

직선 위에 중심을 갖는 k-센터를 계산하는 알고리즘

  • 나현숙 (숭실대학교 컴퓨터학부) ;
  • 신찬수 (한국외국어대학교 디지털정보공학)
  • Published : 2007.12.15
Download PDF
⟨ Previous Next ⟩

Abstract

This paper considers variants of k-center problems to find the set of disks with centers on a given (or moving) line with fixed orientation such that the disks contain a given point set and the maximum radius of the disks is minimized.

이차원 평면에 주어진 점들을 포함하면서 고정된 기울기를 갖는 직선 위에 중심을 갖는 k개의 디스크를 찾는 데, 최대 디스크의 반지름이 최소가 되는 디스크 집합을 계산하는 문제를 다룬다.

Keywords

References

  1. N. Meggido, Applying parallel computation algorithms in the design of serial algorithms, Journal of ACM, 30, pp. 852-865, 1983 https://doi.org/10.1145/2157.322410
  2. M. Sharir, A Near-Linear Algorithm for the Planar 2-Center Problem, Proc., 12th ACM Symp. on Computational Geometry, pp. 106-112, 1996
  3. T. M. Chan, More planar two-center algorithms, Computational Geometry: Theory and Applications, 13, pp. 189-198, 1999
  4. H. Alt, E. M. Arkin, H. Bronnimann, J. Erickson, S. P. Fekete, C. Knauer, J. Lenchner, J. S. B. Mitchell, K. Whittlesey, Minimum-Cost Coverage of Point Sets by Disks, 22th ACM Symp. on Computational Geometry, pp. 449-458, 2006[6]
  5. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, Compuational Geometry: Algorithms and Applications, 2nd Ed. Springer, 2000[6]