Constrained minimum enclosing circle with center on a query line segment

Authors:
Sasanka Roy;Arindam Karmakar;Sandip Das;Subhas C. Nandy
Affiliations:
Tata Consultancy Services, Pune, 411013, India;Indian Statistical Institute, Kolkata, 700108, India;Indian Statistical Institute, Kolkata, 700108, India;Indian Statistical Institute, Kolkata, 700108, India
Venue:
Computational Geometry: Theory and Applications
Year:
2009

Citing 5
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
A linear-time algorithm for computing the Voronoi diagram of a convex polygon

Discrete & Computational Geometry
Facility Location Constrained to a Polygonal Domain

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Farthest-point queries with geometric and combinatorial constraints

Computational Geometry: Theory and Applications
Closest-point problems

SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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(log^2n).