Optimal External Memory Planar Point Enclosure

    Algorithmica, pp. 337-352, 2009.

    Cited by: 22|Bibtex|Views5|Links
    EI
    Keywords:
    External memory algorithmsPoint enclosureData structures

    Abstract:

    In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) such that all K rectangles containing a query point can be reported I/O-efficiently. This problem has important applications in e.g. spatial and temporal databases, and is ...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments