Fast dynamic intersection searching in a set of isothetic line segments (Q1065550): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ralf Hartmut Gueting / rank
Normal rank
 
Property / author
 
Property / author: Ralf Hartmut Gueting / 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/0020-0190(85)90054-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057377210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposable searching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to rectangle intersections part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some methods of computational geometry applied to computer graphics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting and Reporting Intersections of d-Ranges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms to compute the closure of a set of iso-rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear line segment intersection, layered segment trees, and dynamization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4721677 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:24, 14 June 2024

scientific article
Language Label Description Also known as
English
Fast dynamic intersection searching in a set of isothetic line segments
scientific article

    Statements

    Fast dynamic intersection searching in a set of isothetic line segments (English)
    0 references
    1985
    0 references
    0 references
    0 references
    0 references
    0 references
    computational geometry
    0 references
    line segment intersection searching
    0 references
    segment tree
    0 references
    range tree
    0 references
    halfobject technique
    0 references
    0 references