Euclidean Visibility Graph
A Euclidean Visibility Graph is a visibility graph in which the vertices represent point locations in a Euclidean space and the edges indicate pairwise visibility determined by the absence of occluding obstacles along the straight-line segment connecting the points.
5
Publications
271
Citations
15
Authors
10
Institutions
Publications per year
2017–2026
1
Variants
Euclidean Visibility Graphs
Parents
5
Visibility-polygon search and euclidean shortest paths
Takao Asano, Tetsuo Asano, Leonidas Guibas et al. · 1985 · 134 citations
Direction weighted shortest path planning
Jürgen Sellen · 2002 · 17 citations
1–5 of 5
15
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 15
10
University of Copenhagen
Copenhagen, Denmark
1 h-index
1 publications
21 citations

Northwestern Polytechnical University
Xi'an, China
1 h-index
2 publications
38 citations

Osaka Electro-Communication University
Neyagawa, Japan
1 h-index
2 publications
268 citations
Northwest University
Xi'an, China
1 h-index
1 publications
19 citations
Guangzhou University
Guangzhou, China
1 h-index
1 publications
19 citations
Sophia University
Tokyo, Japan
1 h-index
2 publications
268 citations
Indian Institute of Technology Delhi
New Delhi, India
1 h-index
2 publications
160 citations
The University of Tokyo
Tokyo, Japan
1 h-index
1 publications
134 citations
1–8 of 10
1 publications · 21 citations
1
h-index
1 publications · 19 citations
1
h-index
1–2