Subdivision methods for sum-of-distances problems: Fermat-Weber point, \(n\)-ellipses and the min-sum cluster Voronoi diagram (media exposition) (Q6539581)
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: Subdivision methods for sum-of-distances problems: Fermat-Weber point, n-ellipses and the min-sum cluster Voronoi diagram (media exposition) |
scientific article; zbMATH DE number 7849067
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subdivision methods for sum-of-distances problems: Fermat-Weber point, \(n\)-ellipses and the min-sum cluster Voronoi diagram (media exposition) |
scientific article; zbMATH DE number 7849067 |
Statements
Subdivision methods for sum-of-distances problems: Fermat-Weber point, \(n\)-ellipses and the min-sum cluster Voronoi diagram (media exposition) (English)
0 references
14 May 2024
0 references
Fermat point
0 references
geometric median
0 references
Weber point
0 references
Fermat distance
0 references
sum of distances
0 references
\(n\)-ellipse
0 references
multifocal ellipse
0 references
min-sum Voronoi diagram
0 references
cluster Voronoi diagram
0 references
0.7808336019515991
0 references
0.7332087755203247
0 references
0.720886766910553
0 references
0.7188810110092163
0 references
