Voronoi Diagrams for European Cities
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
A Voronoi diagram partitions the plane into regions based on the distances to a specific subset of points. With more points, there are more regions and the regions are smaller. This Demonstration generates a Voronoi diagram using major cities for up to three countries or capitals of countries for more than three countries.
[more]
Contributed by: Trey Taylor (July 2016)
Mathematica Summer Camp 2016
Open content licensed under CC BY-NC-SA
Snapshots
Details
Given a set 
of 
points in the plane, the corresponding Voronoi diagram partitions the plane into 
convex polygons such that each polygon 
contains exactly one point of 
, say 
, and every point in 
is closer to 
than to any other point in 
.
Permanent Citation
"Voronoi Diagrams for European Cities"
http://demonstrations.wolfram.com/VoronoiDiagramsForEuropeanCities/
Wolfram Demonstrations Project
Published: July 12 2016
Voronoi Diagrams
Ed Pegg Jr and Jeff Bryant
New York City Subway Stations
Michael Stern
Voronoi Diagrams in Two-Dimensional Regions
Erik Mahieu
The Facilities Location Problem
Tim Neuman and Stan Wagon
B-Spline Curves from Voronoi Polygon Vertices
Enrique Zeleny
Iterative Polygon Simplification
Seth J. Chandler
Four-Color Maps
Ed Pegg Jr
Signed Area of a Polygon
Bruce Atwood (Beloit College) and Stan Wagon (Macalester College)
Testing a Polygon for Convexity and Self-Intersection
Jaime Rangel-Mondragon
Fermat-Weber Point of a Polygonal Chain
Bhaswar B. Bhattacharya
