Vertex Visibility is a geometric predicate in computational geometry that determines whether two vertices in a polygonal environment are mutually visible by an unobstructed line segment lying entirely within the domain, forming the basis for constructing visibility graphs.
92
Publications
3.9K
Citations
185
Authors
111
Institutions
Publications per year
2017–2026
8
Parents
Publications
92
Searching for a Mobile Intruder in a Polygonal Region
I. Suzuki, Masafumi Yamashita · SIAM Journal on Computing · 1992 · 286 citations
Visibility of disjoint polygons
Takao Asano, Tetsuo Asano, Leonidas Guibas et al. · Algorithmica · 1986 · 225 citations
Visibility of a simple polygon
D.T Lee · Computer Vision Graphics and Image Processing · 1983 · 182 citations
1–5 of 92
Authors
185
- JO
5
h-index
- SK
5
h-index
- AL
5
h-index
- SS
5
h-index
- GD
4
h-index
1–5 of 185
Institutions
111
University of Waterloo
Waterloo, Canada
6 h-index
8 publications
492 citations
Institute of Mathematics, Physics, and Mechanics
Ljubljana, Slovenia
5 h-index
7 publications
133 citations
University of Ljubljana
Ljubljana, Slovenia
5 h-index
6 publications
110 citations
Smith College
Northampton, United States
5 h-index
7 publications
169 citations
University of Maribor
Maribor, Slovenia
5 h-index
8 publications
156 citations
University of L'Aquila
L’Aquila, Italy
4 h-index
8 publications
148 citations
Utrecht University
Utrecht, The Netherlands
4 h-index
8 publications
126 citations
Tata Institute of Fundamental Research
Mumbai, India
4 h-index
6 publications
144 citations
1–8 of 111
Venues
- Computational Geometry
10 publications · 263 citations
10
h-index
- Discrete & Computational Geometry
9 publications · 583 citations
9
h-index
- International Journal of Computational Geometry & Applications
IJCGA · 7 publications · 166 citations
7
h-index
- Discrete Applied Mathematics
5 publications · 101 citations
5
h-index
- Information Processing Letters
4 publications · 88 citations
4
h-index
1–5