Visibility Computation

Visibility Computation is a fundamental problem in Computational Geometry that involves determining the regions or points in a geometric environment that are directly visible from a given observer or set of observers, accounting for occlusions caused by obstacles or scene geometry.

958

Publications

47.3K

Citations

1.9K

Authors

658

Institutions

Publications per year

2017–2026

122

Authors

1.9K

  1. DM
    Dinesh Manocha

    University of North Carolina at Chapel Hill, United States

    13 publications · 720 citations

    13

    h-index

  2. SM
    Steven M. LaValle

    University of Illinois Urbana-Champaign, United States

    13 publications · 1K citations

    12

    h-index

  3. LG
    Leonidas Guibas

    Stanford University, United States

    12 publications · 2.1K citations

    12

    h-index

  4. GD
    George Drettakis

    Institut national de recherche en sciences et technologies du numérique, France

    11 publications · 649 citations

    11

    h-index

  5. FD
    Frédo Durand

    Massachusetts Institute of Technology, United States

    11 publications · 993 citations

    11

    h-index

1–5 of 1.9K

Venues

  1. Computer Graphics Forum

    35 publications · 1.4K citations

    23

    h-index

  2. ACM Transactions on Graphics

    TOG · 31 publications · 1.8K citations

    23

    h-index

  3. 16

    h-index

  4. Computational Geometry

    20 publications · 968 citations

    16

    h-index

  5. IEEE Transactions on Visualization and Computer Graphics

    TVCG · 18 publications · 1.1K citations

    15

    h-index

1–5