Construction of a generalized Voronoi diagram with optimal placement of generator points based on the theory of optimal set partitioning (Q1988465): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.30970/ms.53.1.109-112 / rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.30970/ms.53.1.109-112 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3035747581 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 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 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5187067 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.30970/MS.53.1.109-112 / rank | |||
Normal rank |
Latest revision as of 16:45, 16 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Construction of a generalized Voronoi diagram with optimal placement of generator points based on the theory of optimal set partitioning |
scientific article |
Statements
Construction of a generalized Voronoi diagram with optimal placement of generator points based on the theory of optimal set partitioning (English)
0 references
23 April 2020
0 references
The problem of the construction of a generalized Voronoi diagram with optimal placement of a finite number of generator points in a bounded set of the \(n\)-dimensional Euclidean space is considered. A method to solve this problem based on the formulation of the corresponding continuous problem of optimal partitioning of a set with a partition quality criterion providing the corresponding form of the Voronoi diagram is proposed. The numerical method relies on Shor's \(r\)-algorithm.
0 references
Voronoi diagram
0 references
continuous problems of optimal set partitioning
0 references
Shor's \(r\)-algorithm
0 references