Some variations on constrained minimum enclosing circle problem | Journal of Combinatorial Optimization
Skip to main content
Springer Nature Link
Log in

Some variations on constrained minimum enclosing circle problem

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Given a set P of n points and a straight line L, we study three important variations of minimum enclosing circle problem as follows:

  1. (i)

    Computing k identical circles of minimum radius with centers on L, whose union covers all the points in P.

  2. (ii)

    Computing the minimum radius circle centered on L that can enclose at least k points of P.

  3. (iii)

    If each point in P is associated with one of the k given colors, then compute a minimum radius circle with center on L such that at least one point of each color lies inside it.

We propose three algorithms for Problem (i). The first one runs in O(nklogn) time and O(n) space. The second one is efficient where k≪n; it runs in O(nlogn+nk+k 2log3 n) time and O(nlogn) space. The third one is based on parametric search and it runs in O(nlogn+klog4 n) time. For Problem (ii), the time and space complexities of the proposed algorithm are O(nk) and O(n) respectively. For Problem (iii), our proposed algorithm runs in O(nlogn) time and O(n) space.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Notes

  1. Note that, for each pair of consecutive points, there may not exist an element in the FV array.

References

  • Abellanas M, Hurtado F, Icking C, Klein R, Langetepe E, Ma L, Sacriston V (2001) The farthest color Voronoi diagram and related problems. In: 17th European workshop on computational geometry

    Google Scholar 

  • Agarwal PK, Sharir M, Welzl E (1997) The discrete 2-center problem. In: 13th annual symposium on computational geometry, pp 147–155

    Google Scholar 

  • Alt H, Arkin EM, Bronnimann H, Erickson J, Fekete SP, Knauer C, Lenchner J, Mitchell JSB, Whittlesey K (2006) Minimum-cost coverage of point sets by disks. In: Proc 22nd annual ACM symposium on computational geometry, pp 449–458

    Google Scholar 

  • Bose P, Wang Q (2002) Facility location constrained to a polygonal domain. In: 5th Latin American symposium on theoretical informatics. LNCS, vol 2286, pp 153–164

    Google Scholar 

  • Brass P, Knauer C, Na H-S, Shin C-S, Vigneron A (2009) Computing k-centers on a line. Technical report CoRR abs/0902.3282

  • Chan TM (1999) More planar two-center algorithms. Comput Geom 13:189–198

    Article  MathSciNet  MATH  Google Scholar 

  • Cole R (1987) Slowing down sorting networks to obtain faster sorting algorithms. J ACM 34:200–208

    Article  Google Scholar 

  • Cole R, Salowe J, Steiger W, Szemeredi E (1989) An optimal-time algorithm for slope selection. SIAM J Comput 18:792–810

    Article  MathSciNet  MATH  Google Scholar 

  • Gupta UI, Lee DT, Leung JY-T (1982) Efficient algorithms for interval graphs and circular-arc graphs. Networks 12:459–467

    Article  MathSciNet  MATH  Google Scholar 

  • Hochbaum DS, Shmoys D (1985) A best possible heuristic for the k-center problem. Math Oper Res 10:180–184

    Article  MathSciNet  MATH  Google Scholar 

  • Hurtado F, Sacristan V, Toussaint G (2000) Facility location problems with constraints. Stud Locat Anal 15:17–35

    MathSciNet  MATH  Google Scholar 

  • Hwang RZ, Chang RC, Lee RCT (1993) The searching over separators strategy to solve some NP-hard problems in subexponential time. Algorithmica 9:398–423

    Article  MathSciNet  MATH  Google Scholar 

  • Karmakar A, Roy S, Das S (2008) Fast computation of smallest enclosing circle with center on a query line segment. Inf Process Lett 108:343–346

    Article  MathSciNet  Google Scholar 

  • Kim SK, Shin CS (2000) Efficient algorithms for two-center problems for a convex polygon. In: Proc 6th international conference on computing and combinatorics. LNCS, vol 1858, pp 299–309

    Chapter  Google Scholar 

  • Lev-Tov N, Peleg D (2005) Polynomial time approximation schemes for base station coverage with minimum total radii. Comput Netw 47(4):489–501

    Article  MATH  Google Scholar 

  • Marchetti-Spaccamela A (1981) The p-center problem in the plane is NP-complete. In: Proc 19th Allerton conf on communication, control and computing, pp 31–40

    Google Scholar 

  • Matousek J (1991) Randomized optimal algorithm for slope selection. Inf Process Lett 39:183–187

    Article  MathSciNet  MATH  Google Scholar 

  • Megiddo N (1983) Linear-time algorithms for linear programming in R 3 and related problems. SIAM J Comput 12:759–776

    Article  MathSciNet  MATH  Google Scholar 

  • Pahlavan K, Levesque AH (2005) Wireless information networks, vol 1, 2nd edn. Wiley, New York

    Book  Google Scholar 

  • Plesnik J (1987) A heuristic for the p-center problem in graphs. Discrete Appl Math 17:263–268

    Article  MathSciNet  MATH  Google Scholar 

  • Roy S, Karmakar A, Das S, Nandy SC (2006) Constrained minimum enclosing circle with center on a query line segment MFCS, pp 765–776

    Google Scholar 

  • Roy S, Bardhan D, Das S (2008) Base station placement on boundary of a convex polygon. J Parallel Distrib Comput 68:265–273

    Article  MATH  Google Scholar 

  • Vahrenhold J (2007) Line-segment intersection made in-place. Comput Geom 38:213–230

    Article  MathSciNet  MATH  Google Scholar 

  • van Oostrum R, Veltkamp RC (2002) Parametric search made practical. In: SoCG: 18th symposium on computational geometry, pp 1–9

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Engineering, Tezpur University, Assam, 784028, India

    Arindam Karmakar

  2. Indian Statistical Institute, ACM Unit, Kolkata, 700108, India

    Sandip Das & Subhas C. Nandy

  3. School of Computing Science, Simon Fraser University, Burnaby, Canada, V5A 1S6

    Binay K. Bhattacharya

Authors
  1. Arindam Karmakar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sandip Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Subhas C. Nandy
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Binay K. Bhattacharya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sandip Das.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Karmakar, A., Das, S., Nandy, S.C. et al. Some variations on constrained minimum enclosing circle problem. J Comb Optim 25, 176–190 (2013). https://doi.org/10.1007/s10878-012-9452-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-012-9452-4

Keywords

Search

Navigation