Minimum enclosing circle of a set of fixed points and a mobile point

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we study the variations in the center and the radius of the minimum enclosing circle (MEC) of a set of fixed points and one mobile point, moving along a straight line ℓ. Given a set S of n points and a line ℓ in ℝ2, we completely characterize the locus of the center of MEC of the set S ∪ {p}, for all p ∈ ℓ. We show that the locus is a continuous and piecewise differentiable linear function, and each of its differentiable piece lies either on the edges of the farthest-point Voronoi diagram of S, or on a line segment parallel to the line ℓ. Moreover, we prove that the locus can have at most O(n) differentiable pieces and can be computed in linear time, given the farthest-point Voronoi diagram of S. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Banik, A., Bhattacharya, B. B., & Das, S. (2011). Minimum enclosing circle of a set of fixed points and a mobile point. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6552 LNCS, pp. 98–109). https://doi.org/10.1007/978-3-642-19094-0_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free