| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 414383 | Computational Geometry | 2009 | 7 Pages |
Abstract
In this paper, we will study the problem of locating the center of the smallest enclosing circle of a set P of n points, where the center is constrained to lie on a query line segment. The preprocessing time and space complexities of our proposed algorithm are O(nlogn) and O(n) respectively; the query time complexity is O(log2n).
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
