Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems (Q706993)
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: Delaunay partitions in R^n applied to non-convex programs and vertex/facet enumeration problems |
scientific article; zbMATH DE number 2132691
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems |
scientific article; zbMATH DE number 2132691 |
Statements
Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems (English)
0 references
9 February 2005
0 references
Delaunay simplices
0 references
Delaunay partitions
0 references
Voronoi diagrams
0 references
Global optimization
0 references
Facet enumeration
0 references
Vertex enumeration
0 references
0.8866341
0 references
0.8668119
0 references
0.86612725
0 references
0.8654232
0 references
0.86520165
0 references
0.8598058
0 references
0.85647327
0 references
0.85634595
0 references
