I/O-efficient dynamic planar point location (Q1882856): 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/j.comgeo.2003.04.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041762692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: I/O-efficient point location using persistent B-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: External-memory algorithms for processing line segments in geographic information systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal External Memory Interval Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Point Location in General Subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Organization and maintenance of large ordered indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposable searching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional cascading. I: A data structuring technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on Dynamic Planar Point Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Approach to Dynamic Point Location, Ray shooting, and Shortest Paths in Planar Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC 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: Optimal Point Location in a Monotone Subdivision / rank
 
Normal rank
Property / cites work
 
Property / cites work: A space-optimal solution of general region location / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new data structure for representing sorted lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search in Planar Subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic fractional cascading / rank
 
Normal rank
Property / cites work
 
Property / cites work: The design of dynamic data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic maintenance of planar digraphs, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar point location for large data sets / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:06, 7 June 2024

scientific article
Language Label Description Also known as
English
I/O-efficient dynamic planar point location
scientific article

    Statements

    I/O-efficient dynamic planar point location (English)
    0 references
    0 references
    0 references
    1 October 2004
    0 references
    dynamic data structure
    0 references
    logarithmic method
    0 references

    Identifiers