Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations (Q891710)
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. I. Theoretical foundations |
scientific article; zbMATH DE number 6509872
| 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. I. Theoretical foundations |
scientific article; zbMATH DE number 6509872 |
Statements
Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations (English)
0 references
17 November 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 references
