Construction of a generalized Voronoi diagram with optimal placement of generator points based on the theory of optimal set partitioning
Анотація
The problem of construction of a generalized Voronoi diagram with optimal placement of a finite number of generator points in a bounded set of \textit{n}-dimensional Euclidean space is considered. A method is proposed for solving such a problem based on the formulation of the corresponding continuous problem of optimal partitioning of a set in \textit{n}-dimensional Euclidean space with a partition quality criterion that provides the corresponding form of the Voronoi diagram. Further, to solve such a problem, the developed mathematical and algorithmic apparatus is used, the part of which is Shor's \textit{r}-algorithm.
Посилання
Preparata F., Sheimos M., Computational geometry: an introduction, Springer; First Edition edition, 1993.
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 partitioning // Cybernetics and Systems Analysis, 51 (2015), №4, 489–499. https://doi.org/10.1007/s10559-015-9740-y
Kiseleva E.M., Shor N.Z. Continuous problems of optimal set partitioning: theory, algorithms, applications, Kyiv: Naukova Dumka, 2005. (in Russian)
Shor N.Z., Minimization methods for non-differentiable functions, Springer series, Computational mathematics, Berlin: Springer-Verlag, V.3, 1985.
Авторське право (c) 2020 E.M. Kiseleva, L.L. Hart, O.M. Prytomanova , S.V. Zhuravel
Ця робота ліцензується відповідно до Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Matematychni Studii is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) license.