The weighted farthest color Voronoi diagram on trees and graphs. (Q1421027)
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: The weighted farthest color Voronoi diagram on trees and graphs. |
scientific article; zbMATH DE number 2031375
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The weighted farthest color Voronoi diagram on trees and graphs. |
scientific article; zbMATH DE number 2031375 |
Statements
The weighted farthest color Voronoi diagram on trees and graphs. (English)
0 references
23 January 2004
0 references
Several algorithms are proposed for the computation of several variations of Voronoi diagrams having geometric trees and graphs as underlying space: closest site, farthest site, farthest color. The proposed algorithms are proved to be efficient in terms of complexity and can be applied to solve the problem of finding the best placement for a facility minimizing the maximum distance to different classes of sites.
0 references
Voronoi diagrams
0 references
locational planning
0 references
complexity
0 references
algorithms
0 references
geometric trees and graphs
0 references
closest site
0 references
farthest site
0 references
farthest color
0 references
