On Minimum and Maximum Spanning Trees of Linearly Moving Points.
T. Tokuyama, N. Katoh, K. Iwano (1995)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Applications of a New Space-Partitioning Technique.”
On Minimum and Maximum Spanning Trees of Linearly Moving Points.
The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.
H. Edelsbrunner, Micha Sharir, Leonidas J. Guibas (1989)
Discrete & computational geometry
Similarity:
On the Average Number of k-Sets.
M. Pellegrini, P.W. Shor (1992)
Discrete & computational geometry
Similarity:
Halfspace Range Search: An Algorithmic Application of k-Sets.
B. Chazelle, F.P. Preparata (1986)
Discrete & computational geometry
Similarity:
...-Morphic Sets of Prototiles.
P. Schmitt (1987)
Discrete & computational geometry
Similarity:
Shelling Pseudopolyhedra.
P. Goossens (1992)
Discrete & computational geometry
Similarity:
Direction Trees.
R.E. Jamison (1987)
Discrete & computational geometry
Similarity:
On Range Searching with Semialgebraic Sets.
J. Matousek, P.K. Agarwal (1994)
Discrete & computational geometry
Similarity:
On Lazy Randomized Incremental Construction.
O. Schwarzkopf, M. de Berg, K. Dobrindt (1995)
Discrete & computational geometry
Similarity: