Farthest neighbors, maximum spanning trees and related problems in higher dimensions
- 30 April 1992
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 1 (4) , 189-201
- https://doi.org/10.1016/0925-7721(92)90001-9
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Euclidean minimum spanning trees and bichromatic closest pairsDiscrete & Computational Geometry, 1991
- An acyclicity theorem for cell complexes ind dimensionCombinatorica, 1990
- A deterministic view of random sampling and its use in geometryCombinatorica, 1990
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- Approximating the diameter of a set of points in the Euclidean spaceInformation Processing Letters, 1989
- A Randomized Algorithm for Closest-Point QueriesSIAM Journal on Computing, 1988
- Improved algorithms for discs and balls using power diagramsJournal of Algorithms, 1988
- Voronoi diagrams and arrangementsDiscrete & Computational Geometry, 1986
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- How to search in historyInformation and Control, 1985