Algorithms for proximity problems in higher dimensions (Q1917037): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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(95)00009-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2022853835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting distances in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for computing the Voronoi diagram of a convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provably good mesh generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding fixed-radius near neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-radius near neighbors search algorithms for points and segments / 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: Iterated nearest neighbors and finding minimal polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for selection in a min-heap / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-Nearest Neighbor Voronoi Diagrams in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nearest-neighbor graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: L-infinity interdistance selection by parametric search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ENUMERATING INTERDISTANCES IN SPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining the minimal distance of a point set in polylogarithmic time / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:19, 24 May 2024

scientific article
Language Label Description Also known as
English
Algorithms for proximity problems in higher dimensions
scientific article

    Statements

    Algorithms for proximity problems in higher dimensions (English)
    0 references
    0 references
    0 references
    14 January 1997
    0 references
    Delaynay triangulation
    0 references

    Identifiers