Worst-Case Minimum Rectilinear Steiner Trees in All Dimensions.
M. Yvinec (1992)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On-Line Steiner Trees in the Euclidean Plane.”
Worst-Case Minimum Rectilinear Steiner Trees in All Dimensions.
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
H. Edelsbrunner, E. Welzl, P.K. Agarwal, O. Schwarzkopf (1991)
Discrete & computational geometry
Similarity:
The Rooted Tree Embedding Problem into Points in the Plane.
Y. Ikebe, M.A. Perles, A. Tamura, S. Tokunaga (1994)
Discrete & computational geometry
Similarity:
The Number of Different Distances Determined by a Set of Points in the Euclidean Plane.
F.R.K. Chung, E. Szemeredi, W.T. Trotter (1992)
Discrete & computational geometry
Similarity:
Direction Trees.
R.E. Jamison (1987)
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:
Polygonizations of Point Sets in the Plane.
L. Deneen, Gary Shute (1988)
Discrete & computational geometry
Similarity:
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:
A Gallai-Type Transversal Problem in the Plane.
J. Eckhoff (1993)
Discrete & computational geometry
Similarity:
More on k-Sets of Finite Sets in the Plane.
E. Welzl (1986)
Discrete & computational geometry
Similarity:
On Translating One Polyomino To Tile the Plane.
D. Beauquier, M. Nivat (1991)
Discrete & computational geometry
Similarity: