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
Parents
96
Improved MDS-based localization
Yi Shang, Wheeler Ruml · 2005 · 721 citations
The shortest path to happiness
Daniele Quercia, Rossano Schifanella, Luca Maria Aiello · 2014 · 354 citations · Full text
1–5 of 96
250
4
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 250
156

Tel Aviv University
Tel Aviv, Israel
5 h-index
7 publications
241 citations
Brown University
Providence, United States
3 h-index
7 publications
590 citations

University of Toronto
Toronto, Canada
3 h-index
8 publications
330 citations
Stony Brook University
Stony Brook, United States
3 h-index
3 publications
270 citations
Yahoo (Spain)
Madrid, Spain
2 h-index
4 publications
834 citations

University of Electronic Science and Technology of China
Chengdu, China
2 h-index
6 publications
896 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
3 publications
63 citations
University of Cambridge
Cambridge, United Kingdom
2 h-index
8 publications
144 citations
1–8 of 156
3 publications · 60 citations
3
h-index
Conference · 2 publications · 40 citations
2
h-index
2 publications · 74 citations
2
h-index
Repository · 2 publications · 79 citations
2
h-index
2 publications · 291 citations
2
h-index
1–5