ON ENUMERATING AND SELECTING DISTANCES (Q4682169): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting distances in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On range searching with semialgebraic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient construction of a bounded-degree spanner with low weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTTINGS AND APPLICATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Output-sensitive results on convex hulls, extreme points, and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of geometric duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-optimal upper bounds for simplex range searching and new zone theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slowing down sorting networks to obtain faster sorting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for proximity problems in higher dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm for enumerating longest distances in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reliable Randomized Algorithm for the Closest-Pair Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A RANDOMIZED ALGORITHM FOR SLOPE SELECTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Rabin's nearest-neighbor algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of selection and ranking in X+Y and matrices with sorted columns / rank
 
Normal rank
Property / cites work
 
Property / cites work: FINDING k FARTHEST PAIRS AND k CLOSEST/FARTHEST BICHROMATIC PAIRS FOR POINTS IN THE PLANE / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Expander-Based Approach to Geometric Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple randomized sieve algorithm for the closest-pair problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized optimal algorithm for slope selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient partition trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reporting points in halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On counting pairs of intersecting segments and off-line triangle range searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: ENUMERATING INTERDISTANCES IN 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:17, 10 June 2024

scientific article; zbMATH DE number 2174820
Language Label Description Also known as
English
ON ENUMERATING AND SELECTING DISTANCES
scientific article; zbMATH DE number 2174820

    Statements

    ON ENUMERATING AND SELECTING DISTANCES (English)
    0 references
    0 references
    10 June 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Distance enumeration
    0 references
    distance selection
    0 references
    closest pairs
    0 references
    range counting
    0 references
    randomized algorithms
    0 references