On the Number of Minimal 1-Steiner Trees.
B. Aronov, D. Eppstein, M. Bern (1994)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Steiner Minimal Trees on Sets of Four Points.”
On the Number of Minimal 1-Steiner Trees.
A Décomposition Theorem on Euclidean Steiner Minimal Trees.
D.Z. Du, F.K. Hwang, G.D. Song, G.Y Ting (1988)
Discrete & computational geometry
Similarity:
Steiner Minimal Trees for Regular Polygons.
D.Z. Du, F.K. Hwang, J.F. Wenig (1987)
Discrete & computational geometry
Similarity:
Analytic Formulas for Full Steiner Trees.
R.S. Booth (1991)
Discrete & computational geometry
Similarity:
Worst-Case Minimum Rectilinear Steiner Trees in All Dimensions.
M. Yvinec (1992)
Discrete & computational geometry
Similarity:
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
H. Edelsbrunner, E. Welzl, P.K. Agarwal, O. Schwarzkopf (1991)
Discrete & computational geometry
Similarity:
Direction Trees.
R.E. Jamison (1987)
Discrete & computational geometry
Similarity:
Transitions in Geometric Minimum Spanning Trees.
R. Kenyon, C. Kenyon (1992)
Discrete & computational geometry
Similarity:
The Steiner Minimal Network for Convex Configurations.
J.H. Rubinstein, D.A. Thomas, T. Cole (1993)
Discrete & computational geometry
Similarity:
On Minimum and Maximum Spanning Trees of Linearly Moving Points.
T. Tokuyama, N. Katoh, K. Iwano (1995)
Discrete & computational geometry
Similarity:
Low-Degree Minimum Spanning Trees.
G. Robins, J.S. Salowe (1995)
Discrete & computational geometry
Similarity: