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

Authors

251

  1. SM
    Steven M. LaValle

    University of Illinois Urbana-Champaign, United States

    4 publications · 363 citations

    4

    h-index

  2. NS
    Nageswara S. V. Rao

    Oak Ridge National Laboratory, United States

    4 publications · 301 citations

    4

    h-index

  3. SS
    S. S. Iyengar

    Louisiana State University, United States

    3 publications · 217 citations

    3

    h-index

  4. KC
    Kyung‐Yong Chwa

    Korea Advanced Institute of Science and Technology, South Korea

    2 publications · 24 citations

    2

    h-index

  5. FS
    Flemming Schøler

    Aalborg University, Denmark

    2 publications · 64 citations

    2

    h-index

1–5 of 251

Venues

  1. Chaos Solitons & Fractals

    4 publications · 95 citations

    4

    h-index

  2. 4

    h-index

  3. 3

    h-index

  4. Robotica

    2 publications · 40 citations

    2

    h-index

  5. Information Processing Letters

    2 publications · 320 citations

    2

    h-index

1–5