Fixed-radius near neighbors search algorithms for points and segments (Q916423): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The complexity of finding fixed-radius near neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sweepline algorithm for Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plane-sweep algorithms for intersecting geometric figures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new linear algorithm for intersecting convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments / rank
 
Normal rank

Latest revision as of 08:50, 21 June 2024

scientific article
Language Label Description Also known as
English
Fixed-radius near neighbors search algorithms for points and segments
scientific article

    Statements

    Fixed-radius near neighbors search algorithms for points and segments (English)
    0 references
    1990
    0 references
    computational geometry
    0 references
    design of algorithms
    0 references
    analysis of algorithms
    0 references

    Identifiers