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)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: 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; zbMATH DE number 6497640
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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; zbMATH DE number 6497640 |
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
0.9832621
0 references
0.88620543
0 references
0.8800684
0 references
0.8714027
0 references
0.8612442
0 references
0.8514745
0 references
0.8477308
0 references
