• Publications
  • Influence
Minimal Steiner Trees for 2k×2k Square Lattices
This paper proves a conjecture that the minimal Steiner trees for the set of points comprising the vertices of a 2k×2ksquare lattice are given by Chung, Graham, and Gardner. Expand
A 75° Angle Constraint for Plane Minimal T1 Trees
  • T. Cole
  • Mathematics, Computer Science
  • J. Comb. Optim.
  • 1 June 2000
It is shown that the minimum angle between any 2 edges of an Euclidean plane minimal T1 tree, or 3-size Steiner tree, is at least 75°. Expand
The steiner minimal network for convex configurations
The variational approach is used to show the Steiner treeS coincides with the minimal spanning tree and consists of all these edges with a longest edge removed, which generalizes Graham's problem for points on a circle. Expand
Non-crossing of plane minimal spanning and minimal T1 networks
  • T. Cole
  • Computer Science, Mathematics
  • Discret. Math.
  • 1 December 1997
Abstract For any given collection of Euclidean plane points it will be shown that a minimal length T 1 network (or 3-size quasi Steiner network (Du et al., 1991)) will intersect a minimal spanningExpand