Wednesday, June 11, 2003

from that page: (some problem with voronoi diagram)

minimal spanning trees and Delaunay triangulations
Kragen Sitaker
Thu, 8 Jul 1999 16:35:25 -0400 (EDT)

Previous message: more on wax and eternal resource locators
Next message: good software
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]


This is probably a well-known result, or maybe it's just wrong, but I
was excited when I discovered it this morning.

It seems that every geometric minimal spanning tree of a set of points
must be a subgraph of every Delaunay triangulation of that set of points.