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 (Q747294): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S10559-015-9740-Y / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10559-015-9740-Y / rank | |||
Normal rank | |||
Latest revision as of 03:02, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 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 |
scientific article |
Statements
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 (English)
0 references
23 October 2015
0 references
Voronoi diagram
0 references
continuous problem of optimal partitioning of sets from \(E_n\)
0 references
Shor's \(r\)-algorithm
0 references
