Visibility Graph Search
Visibility Graph Search is a computational method that systematically explores the connectivity structure of a visibility graph to identify optimal or feasible paths by leveraging visibility relationships among geometric entities, distinguishing it from general graph search techniques through its specific application to spatial reasoning and obstacle-avoidance problems.
100
Publications
3.8K
Citations
251
Authors
141
Institutions
Publications per year
2017–2026
41
Parents
100
1–5 of 100
251
University of Illinois Urbana-Champaign, United States
4 publications · 363 citations
4
h-index
4
h-index
3
h-index
Korea Advanced Institute of Science and Technology, South Korea
2 publications · 24 citations
2
h-index
2
h-index
1–5 of 251
141
University of Southern California
Los Angeles, United States
5 h-index
7 publications
267 citations
Simon Fraser University
Burnaby, Canada
4 h-index
7 publications
162 citations
Southwest University
Chongqing, China
3 h-index
5 publications
401 citations
California Southern University
Chandler, United States
3 h-index
4 publications
86 citations
Louisiana State University
Baton Rouge, United States
3 h-index
6 publications
434 citations
Stanford University
Stanford, United States
3 h-index
8 publications
1.7K citations

Northwestern Polytechnical University
Xi'an, China
2 h-index
5 publications
136 citations
Wuhan University of Technology
Wuhan, China
2 h-index
3 publications
50 citations
1–8 of 141
4 publications · 95 citations
4
h-index
4 publications · 157 citations
4
h-index
IJCGA · 3 publications · 337 citations
3
h-index
2 publications · 40 citations
2
h-index
2 publications · 320 citations
2
h-index
1–5