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 partitioning

DOI10.1007/s10559-015-9740-yzbMath1322.93031OpenAlexW2340126059MaRDI QIDQ747294

L. S. Koriashkina, E. M. Kiseleva

Publication date: 23 October 2015

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-015-9740-y

zbMATH Keywords

Voronoi diagramShor's \(r\)-algorithmcontinuous problem of optimal partitioning of sets from \(E_n\)

Mathematics Subject Classification ID

Applications of optimal control and differential games (49N90) Nonlinear systems in control theory (93C10) Geometric methods (93B27)

Related Items (3)

Construction of a generalized Voronoi diagram with optimal placement of generator points based on the theory of optimal set partitioning ⋮ 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 partitioning ⋮ Application of the theory of optimal set partitioning for constructing fuzzy Voronoi diagrams

Cites Work

• Unnamed Item
• 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 partitioning
• Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations
• Modified \(r\)-algorithm to find the global minimum of polynomial functions
• Nonsmooth-optimization methods in problems of stochastic programming

This page was built for publication: 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 partitioning