Priority Search Trees

A Priority Search Tree is a geometric data structure that organizes two-dimensional points to support efficient range queries by combining the properties of binary search trees and priority queues, distinguishing it from other spatial data structures through its ability to prioritize queries based on one coordinate while searching on another.

19

Publications

6.4K

Citations

42

Authors

25

Institutions

Publications per year

2017–2026

1

Authors

42

  1. MM
    Marius Muja

    University of British Columbia, Canada

    3 publications · 4.3K citations

    3

    h-index

  2. DL
    David Lowe

    University of British Columbia, Canada

    3 publications · 4.3K citations

    3

    h-index

  3. HH
    Herman Haverkort

    Eindhoven University of Technology, Netherlands

    2 publications · 231 citations

    2

    h-index

  4. SS
    Sairam Subramanian

    Brown University, United States

    2 publications · 96 citations

    2

    h-index

  5. KY
    Ke Yi

    Hong Kong University of Science and Technology, Hong Kong SAR China

    2 publications · 231 citations

    2

    h-index

1–5 of 42

Venues

  1. 1

    h-index

  2. ACM Transactions on Algorithms

    TALG · 1 publications · 116 citations

    1

    h-index

  3. Symmetry

    1 publications · 18 citations

    1

    h-index

  4. GeoInformatica

    1 publications · 17 citations

    1

    h-index

  5. 1

    h-index

1–5