Weak Visibility

Weak Visibility is a visibility relation in computational geometry wherein a point or set of points within a polygonal domain is considered visible from a given subset of the boundary if at least one unobstructed line segment connects them, distinguishing it from strong visibility by not requiring the entire segment to lie within the subset.

16

Publications

929

Citations

43

Authors

28

Institutions

Publications per year

2017–2026

2

Authors

43

  1. SP
    Sudebkumar Prasant Pal

    Indian Institute of Technology Kharagpur, India

    2 publications · 51 citations

    2

    h-index

  2. CW
    Changwei Wu

    China University of Petroleum, East China, China

    1 publications · 39 citations

    1

    h-index

  3. LG
    Lemei Gao

    China University of Petroleum, East China, China

    1 publications · 39 citations

    1

    h-index

  4. SK
    Subir Kumar Ghosh

    Tata Institute of Fundamental Research, India

    1 publications · 23 citations

    1

    h-index

  5. JX
    Jing Xie

    China University of Petroleum, East China, China

    1 publications · 39 citations

    1

    h-index

1–5 of 43

Venues

  1. Computational Geometry

    3 publications · 69 citations

    3

    h-index

  2. Optica Acta International Journal of Optics

    1 publications · 17 citations

    1

    h-index

  3. Journal of Graduate Medical Education

    1 publications · 10 citations

    1

    h-index

  4. Environmental Policy and Governance

    1 publications · 39 citations

    1

    h-index

  5. Discrete & Computational Geometry

    1 publications · 33 citations

    1

    h-index

1–5