Dear list, one solution for the network optimization problem is to use Voronoi diagrams. Optimal locations can be defined as locations minimizing the averageJan 12, 2006 1 of 1View SourceDear list,
one solution for the network optimization problem is to use
Voronoi diagrams. Optimal locations can be defined as
locations minimizing the average nearest neighbour distance.
Think of the locations of public mailboxes in a town. The
mailboxes are on an optimal location if the average distance
of the people in the town to their nearest public mailbox is minimized.
This problem is described in detail in the chapter on Locational
author = "Atsuyuki Okabe and Barry Boots and Kokichi Sugihara and Sung
title = "Spatial tessellations: Concepts and applications of Voronoi
publisher = "Wiley",
year = "2000",
series = "Probability and Statistics",
address = "NYC",
edition = "2nd"
>From: "Gregoire Dubois" <gregoire.dubois@...>--
>Subject: [ai-geostats] Optimization of monitoring networks
>Date: Thu, 12 Jan 2006 16:00:33 +0100
>I am looking for references (and possibly software) on network
>optimization. The variable monitored has no importance and I am looking
>for references and topological algorithms.
>A question I have is the following: given an area A with a particular
>shape (e.g. defined by country borders) and a number of stations N (e.g.
>for mobile phone emitters), how do I define the optimal locations for
>Thanks for any hints.
>Gregoire Dubois (Ph.D.)
>European Commission (EC)
>Joint Research Centre (JRC)
>Institute for Environment and Sustainability (IES)
>TP 441, Via Fermi 1
>21020 Ispra (VA)
>Tel. +39 (0)332 78 6360
>Fax. +39 (0)332 78 5466
>"The views expressed are purely those of the writer and may not in any
>circumstances be regarded as stating an official position of the
Dr. R.C. Lindenbergh
Delft Institute of Earth Observation
and Space Systems, section MGP
Delft University of Technology