Skip to main content
SpringerLink
Log in

Geometric Algorithms for Finding a Point in the Intersection of Balls

  • Topical Issue
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

We consider a problem of finding a point in the intersection of n balls in the Euclidean space Em. For the case m = 2 we suggest two algorithms of the complexity O(n2 log n) and O(n3) operations, respectively. For the general case we suggest an exact polynomial recursive algorithm which uses the orthogonal transformation of the space Em.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Barketov, M.S., Polynomial Methods for Determining a Point in the intersection of a Certain Number of Balls, Tanaev’s Readings, Proc. of the Eighth Int. Scientific Conf., March 27–30, 2018, Minsk: UIIP, 2018, pp. 18–22.

    Google Scholar 

  2. Otto, A., Agatz, N., Campbell, J., Golden, B., and Pesch, E., Optimization Approaches for Civil Applications of Unmanned Aerial Vehicles (UAVs) or Aerial Drones: A Survey, Networks, 2018, vol. 72, pp. 411–458.

    Article  MathSciNet  Google Scholar 

  3. Papadimitriou, C.H. and Steiglitz, K., Combinatorial Optimization: Algorithms and Complexity, Englewood Cliffs: Prentice Hall, 1982. Translated under the title Kombinatornaya optimizatsiya: algoritmy i slozhnost’, Moscow: Mir, 1985

    MATH  Google Scholar 

  4. Boyd, S.S., El Ghaoui, L., Feron, E., and Balakrishnan, V., Linear Matrix Inequalities in System and Control Theory, SIAM Studies Appl. Math., 1994, vol. 15.

    Google Scholar 

  5. Beck, A., On the Convexity of a Class of Quadratic Mappings and Its Application to the Problem of Finding the Smallest Ball Enclosing a Given Intersection of Balls, J. Global Optim., 2007, vol. 39, no. 1, pp. 113–126.

    Article  MathSciNet  Google Scholar 

  6. Minu, M., Matematicheskoe programmirovanie. Teoriya i algoritmy (Mathematical Programming. Theory and Algorithms), Moscow: Nauka, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Belarusian State University of Informatics and Radioelectronics, Minsk, Belarus

    I. N. Lushchakova

Authors
  1. I. N. Lushchakova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. N. Lushchakova.

Additional information

This paper was recommended for publication by A. A. Lazarev, a member of the Editorial Board

Russian Text © The Author(s), 2020, published in Avtomatika i Telemekhanika, 2020, No. 5, pp. 139–155.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lushchakova, I.N. Geometric Algorithms for Finding a Point in the Intersection of Balls. Autom Remote Control 81, 869–882 (2020). https://doi.org/10.1134/S0005117920050070

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117920050070

Keywords

Search

Navigation