Constrained minimum enclosing circle with center on a query line segment

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).