Thursday, March 11, 2004

Voronoi Diagrams and school districts 

According to my Computational Geometry in C textbook (by Joseph O'Rourke) the Voronoi diagram is a geometric structure second in importance only to the convex hull. He continues with some applications:
Imagine a vast forest containing a number of fire observation towers. Each ranger is responsible for extinguishing any fire closer to her tower than to any other tower. The set of all trees for which a particular ranger is responsible constitutes the "Voronoi polygon" associated with her tower. The Vornoi diagram maps out the lines between these areas of responsibility: the spots in the forest that are equidistant from two or more towers.

Imagine now the perverse situation where all the rangers ignite their towers simultaneously, and the forest burns at a uniform rate. The fire will spread in circles centered on each tower. The points at which the fire quenches because it reaches previously consumed trees are those points equidistant from two or more towers, which are exactly the points on the Voronoi diagram.

My city is redistricting its 9 elementary schools. Voronoi diagrams come to mind, to suggest a districting such that each child attends the nearest school. And I'm trying to use one of the algorithms O'Rourke discusses to make the diagram for the city. But even if I do, there are at least five wrinkes:

Any thoughts or solutions welcome.

Comments: Post a Comment

Links to this post:

Create a Link

This page is powered by Blogger. Isn't yours?