Farthest neighbors, maximum spanning trees and related problems in higher dimensions
type: Item
instance of: scholarly article
title: Farthest neighbors, maximum spanning trees and related problems in higher dimensions
zbMATH Open document ID: 0769.68037
DOI: 10.1016/0925-7721(92)90001-9
author: Pankaj K. Agarwal
author: Subhash Suri
author: Jiří Matoušek
published in: Computational Geometry
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 52B05
zbMATH DE Number: 64220
zbMATH Keywords: randomized algorithm
zbMATH Keywords: time complexity
zbMATH Keywords: farthest neighbors
zbMATH Keywords: maximum spanning tree
zbMATH Keywords: approximation algorithms
zbMATH Keywords: \(k\)-dimensional space
MaRDI profile type: Publication
full work available at URL: 0925-7721(92)90001-9
OpenAlex ID: W2158944832
cites work: Euclidean minimum spanning trees and bichromatic closest pairs
cites work: Improved algorithms for discs and balls using power diagrams
cites work: How to search in history
cites work: A deterministic view of random sampling and its use in geometry
cites work: A Randomized Algorithm for Closest-Point Queries
cites work: Applications of random sampling in computational geometry. II
cites work: An acyclicity theorem for cell complexes in d dimensions
cites work: Q3772828
cites work: Voronoi diagrams and arrangements
cites work: Approximating the diameter of a set of points in the Euclidean space
cites work: A linear-time algorithm for a special case of disjoint set union
cites work: On the History of the Minimum Spanning Tree Problem
cites work: \(\epsilon\)-nets and simplex range queries
cites work: Computing Euclidean maximum spanning trees
cites work: Q3992847
cites work: Q4028870
cites work: Minimum Spanning Trees in k-Dimensional Space
cites work: An O(n log n) algorithm for the all-nearest-neighbors problem
cites work: On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
Wikidata QID: Q127212875
description: scientific article; zbMATH DE number 64220