摘要
Consider a set of n straight lines in the plane. The diameter of the set of lines is the distance between the farthest pair of intersection points determined by the set of lines. In this paper we present an O(n log n) algorithm for computing the diameter and show that the algorithm is optimal to within a constant factor under the algebraic computation tree model of Ben-Or.
| 原文 | English |
|---|---|
| 頁（從 - 到） | 249-255 |
| 頁數 | 7 |
| 期刊 | Pattern Recognition |
| 卷 | 18 |
| 發行號 | 3-4 |
| DOIs | |
| 出版狀態 | Published - 1985 |