Thursday February 14, 2002
Dilation-Free Planar Graphs
Suppose you've been hired to lay out the buildings of a college campus. College students are disrespectful of authority (at least, of campus planners) and will cut new paths through the campus lawns between any buildings not already directly connected by paths. So will the faculty. But then, wherever two paths meet, some entrepreneur is likely to place a coffee stand. This new coffee stand will attract students, who will form paths from it to all campus buildings, etc. Before long, your campus will be all covered by paths, with no lawn left. Or will it? How can you lay out your campus so that all buildings are already directly connected by paths, without forming crossroads and encouraging coffee-stand builders?

From The Geometry Junkyard of course.  Nice logo too. Today's geometry song: Dodecagon Dogs.