Shortest Path Maps

Shortest Path Maps is a computational geometric construct that partitions a visibility space into regions according to the combinatorial structure of shortest paths from a fixed source point to all possible destination points within a polygonal domain.

96

Publications

5K

Citations

250

Authors

156

Institutions

Publications per year

2017–2026

29

Authors

250

  1. JS
    Joseph S. B. Mitchell

    Stony Brook University, United States

    4 publications · 329 citations

    4

    h-index

  2. MS
    Micha Sharir

    Tel Aviv University, Israel

    3 publications · 141 citations

    3

    h-index

  3. DQ
    Daniele Quercia

    Nokia (United Kingdom), United Kingdom

    2 publications · 417 citations

    3

    h-index

  4. YS
    Yevgeny Schreiber

    Tel Aviv University, Israel

    3 publications · 80 citations

    3

    h-index

  5. II
    Iswanto Iswanto

    Muhammadiyah University of Yogyakarta, Indonesia

    2 publications · 36 citations

    2

    h-index

1–5 of 250

Venues

  1. 3

    h-index

  2. Symposium on Discrete Algorithms

    Conference · 2 publications · 40 citations

    2

    h-index

  3. Sustainability

    2 publications · 74 citations

    2

    h-index

  4. arXiv (Cornell University)

    Repository · 2 publications · 79 citations

    2

    h-index

  5. 2

    h-index

1–5