On the Euclidean Center Problem

  • Chwa, Kyung-Yong (Korea Advanced Institute of Science and Technology, Department of Computer Science)
  • 발행 : 1982.10.01

초록

This paper presents an efficient algorithm for finding a new facility(center) in the Euclidean plane in accordance with minimax criterion: that is, the facility is located to minimize the maximum weighted Euclidean distance. The method given in this paper involves computational geometry. Some possible extensions of this problem are also discussed.

키워드