Euclidean minimum spanning trees and bichromatic closest pairs
- 1 September 1991
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 6 (3) , 407-422
- https://doi.org/10.1007/bf02574698
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Combinatorial complexity bounds for arrangements of curves and spheresDiscrete & Computational Geometry, 1990
- Euclidean minimum spanning trees and bichromatic closest pairsPublished by Association for Computing Machinery (ACM) ,1990
- A randomized algorithm for fixed-dimensional linear programmingMathematical Programming, 1989
- Efficient spatial point locationLecture Notes in Computer Science, 1989
- A Randomized Algorithm for Closest-Point QueriesSIAM Journal on Computing, 1988
- Planar point location using persistent search treesCommunications of the ACM, 1986
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- How to search in historyInformation and Control, 1985
- Scaling and related techniques for geometry problemsPublished by Association for Computing Machinery (ACM) ,1984
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related ProblemsSIAM Journal on Computing, 1982