Farthest neighbors, maximum spanning trees and related problems in higher dimensions (Q1194310): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q127212875, #quickstatements; #temporary_batch_1723471789570
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ji{ří} Matoušek / rank
Normal rank
 
Property / author
 
Property / author: Ji{ří} Matoušek / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0925-7721(92)90001-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2158944832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean minimum spanning trees and bichromatic closest pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for discs and balls using power diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to search in history / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic view of random sampling and its use in geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Algorithm for Closest-Point Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of random sampling in computational geometry. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: An acyclicity theorem for cell complexes in d dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi diagrams and arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the diameter of a set of points in the Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for a special case of disjoint set union / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the History of the Minimum Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-nets and simplex range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Euclidean maximum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Spanning Trees in <i>k</i>-Dimensional Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for the all-nearest-neighbors problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127212875 / rank
 
Normal rank

Latest revision as of 15:11, 12 August 2024

scientific article
Language Label Description Also known as
English
Farthest neighbors, maximum spanning trees and related problems in higher dimensions
scientific article

    Statements

    Farthest neighbors, maximum spanning trees and related problems in higher dimensions (English)
    0 references
    0 references
    0 references
    0 references
    27 September 1992
    0 references
    randomized algorithm
    0 references
    time complexity
    0 references
    farthest neighbors
    0 references
    maximum spanning tree
    0 references
    approximation algorithms
    0 references
    \(k\)-dimensional space
    0 references

    Identifiers