Skip to main content
SpringerLink
Log in

Theory of Continuous Optimal set Partitioning Problems as a Universal Mathematical Formalism for Constructing Voronoi Diagrams and Their Generalizations. Ii. Algorithms for Constructing Voronoi Diagrams Based on the Theory of Optimal set Partitioning1

  • CYBERNETICS
  • Published:
Cybernetics and Systems Analysis Aims and scope

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

References

  1. E. M. Kiseleva and L. S. Koriashkina, “Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations,” Cybernetics and Systems Analysis, 51, No. 3, 325–335 (2015).

    Article  Google Scholar 

  2. E. M. Kiseleva and L. S. Koriashkina, Models and Methods for Solving Continuous Problems of Optimal Set Partitioning: Linear, Nonlinear, and Dynamic Problems [in Russian], Naukova Dumka, Kyiv (2013).

    Google Scholar 

  3. E. M. Kiseleva and N. Z. Shor, Continuous Problems of Optimal Set Partitioning: Theory, Algorithms, and Applications [in Russian], Naukova Dumka, Kyiv (2005).

    Google Scholar 

  4. N. Z. Shor, Methods of Minimization of Nondifferentiable Functions and Their Applications [in Russian], Naukova Dumka, Kyiv (1979).

    Google Scholar 

  5. N. Z. Shor, T. A. Bardadym, N. G. Zhurbenko, A. P. Lykhovid, and P. I. Stetsyuk, “Nonsmooth-optimization methods in problems of stochastic programming,” Cybernetics and Systems Analysis, 35, No. 5, 708–720 (1999).

    Article  MATH  MathSciNet  Google Scholar 

  6. N. Z. Shor and S. I. Stetsenko, Quadratic Extremal Problems and Nondifferentiable Optimization [in Russian], Naukova Dumka, Kyiv (1989).

    Google Scholar 

  7. N. Z. Shor and P. I. Stetsyuk, “Modified r-algorithm to find the global minimum of polynomial functions,” Cybernetics and Systems Analysis, 33, No. 4, 482–497 (1997).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Oles Honchar Dnipropetrovsk National University, Dnipropetrovsk, Ukraine

    E. M. Kiseleva & L. S. Koriashkina

Authors
  1. E. M. Kiseleva
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. S. Koriashkina
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to E. M. Kiseleva.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 3–12, July–August, 2015.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kiseleva, E.M., Koriashkina, L.S. Theory of Continuous Optimal set Partitioning Problems as a Universal Mathematical Formalism for Constructing Voronoi Diagrams and Their Generalizations. Ii. Algorithms for Constructing Voronoi Diagrams Based on the Theory of Optimal set Partitioning1 . Cybern Syst Anal 51, 489–499 (2015). https://doi.org/10.1007/s10559-015-9740-y

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-015-9740-y

Keywords

Search

Navigation