Robust Visibility Computation

Robust Visibility Computation is a computational method in visibility graph theory that reliably determines visibility relationships among geometric entities under challenging conditions, such as numerical imprecision, sensor noise, or complex occlusion patterns, by ensuring consistency, accuracy, and stability in the resulting visibility structure.

11

Publications

485

Citations

27

Authors

13

Institutions

Publications per year

2017–2026

0

Authors

27

  1. GD
    George Drettakis

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

    3 publications · 139 citations

    3

    h-index

  2. TA
    Tomas Akenine‐Möller

    Lund University, Sweden

    2 publications · 194 citations

    2

    h-index

  3. FD
    Florent Duguet

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

    2 publications · 62 citations

    2

    h-index

  4. UA
    Ulf Assarsson

    Chalmers University of Technology, Sweden

    2 publications · 194 citations

    2

    h-index

  5. AB
    Adrien Bousseau

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

    1 publications · 77 citations

    1

    h-index

1–5 of 27

Venues

  1. ACM Transactions on Graphics

    TOG · 3 publications · 163 citations

    3

    h-index

  2. The Visual Computer

    1 publications · 10 citations

    1

    h-index

  3. IEEE Transactions on Visualization and Computer Graphics

    TVCG · 1 publications · 18 citations

    1

    h-index

  4. 1

    h-index

  5. 1

    h-index

1–5