DocumentCode
2163452
Title
On the Voronoi diagram of a nondirected flow network
Author
Tamura, H. ; Sengoku, M. ; Shinoda, S.
Author_Institution
Dept. of Inf. Eng., Niigata Univ., Japan
fYear
1988
fDate
7-9 June 1988
Firstpage
1321
Abstract
The authors give the definition of a Voronoi diagram with respect to the capacity of a nondirected flow network with some vertices called centers. Algorithms to modify the Voronoi diagram with a change of the set of centers are proposed. These algorithms are useful in connection with the problem of optimally locating centers on a flow network.<>
Keywords
graph theory; network topology; Voronoi diagram; algorithms; nondirected flow network; optimal location; set of centers; Computational geometry; Fluid flow measurement; Length measurement; Terminology;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1988., IEEE International Symposium on
Conference_Location
Espoo, Finland
Type
conf
DOI
10.1109/ISCAS.1988.15171
Filename
15171
Link To Document