Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
H. Edelsbrunner, E. Welzl, P.K. Agarwal, O. Schwarzkopf (1991)
Discrete & computational geometry
Similarity:
Displaying similar documents to “On Minimum and Maximum Spanning Trees of Linearly Moving Points.”
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
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:
Worst-Case Minimum Rectilinear Steiner Trees in All Dimensions.
M. Yvinec (1992)
Discrete & computational geometry
Similarity:
Low-Degree Minimum Spanning Trees.
G. Robins, J.S. Salowe (1995)
Discrete & computational geometry
Similarity:
Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions.
D. Eppstein (1995)
Discrete & computational geometry
Similarity:
Analytic Formulas for Full Steiner Trees.
R.S. Booth (1991)
Discrete & computational geometry
Similarity:
Applications of a New Space-Partitioning Technique.
M. Sharir, P.K. Agarwal (1993)
Discrete & computational geometry
Similarity:
On the Number of Minimal 1-Steiner Trees.
B. Aronov, D. Eppstein, M. Bern (1994)
Discrete & computational geometry
Similarity:
A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-Complete Problems.
M. Kolinek (1987)
Discrete & computational geometry
Similarity:
Steiner Minimal Trees on Sets of Four Points.
D.Z. Du, F.K. Hwang, G.D. Song, G.Y Ting (1987)
Discrete & computational geometry
Similarity: