## 抄録

Given a set P of n points on which facilities can be placed and an integer k, we want to place k facilities on some points so that the minimum distance between facilities is maximized. The problem is called the k-dispersion problem. In this paper, we consider the 3-dispersion problem when P is a set of points on a plane (2-dimensional space). Note that the 2-dispersion problem corresponds to the diameter problem. We give an O(n) time algorithm to solve the 3-dispersion problem in the L_{∞} metric, and an O(n) time algorithm to solve the 3-dispersion problem in the L_{1} metric. Also, we give an O(n^{2} log n) time algorithm to solve the 3-dispersion problem in the L_{2} metric.

本文言語 | English |
---|---|

ページ（範囲） | 1101-1107 |

ページ数 | 7 |

ジャーナル | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |

巻 | E104A |

号 | 9 |

DOI | |

出版ステータス | Published - 2021 |

## ASJC Scopus subject areas

- 信号処理
- コンピュータ グラフィックスおよびコンピュータ支援設計
- 電子工学および電気工学
- 応用数学