Rotational Sweep Algorithms
Rotational Sweep Algorithms is a computational geometry method that systematically processes geometric objects by rotating a directed line or plane around a fixed point or axis to determine visibility relationships among scene elements.
8
Publications
241
Citations
22
Authors
16
Institutions
Publications per year
2017–2026
2
Parents
8
1–5 of 8
22
2
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 22
16
Pohang University of Science and Technology
Pohang, South Korea
2 h-index
5 publications
112 citations

University of Ottawa
Ottawa, Canada
2 h-index
2 publications
43 citations
Oldenburger Institut für Informatik
Oldenburg, Germany
1 h-index
1 publications
15 citations

University of Electronic Science and Technology of China
Chengdu, China
1 h-index
1 publications
24 citations

Huazhong University of Science and Technology
Wuhan, China
1 h-index
2 publications
48 citations

Universidad de Málaga
Málaga, Spain
1 h-index
3 publications
42 citations
Airbus (Germany)
Hamburg, Germany
1 h-index
1 publications
37 citations
Korea Institute of Science and Technology
Seoul, South Korea
1 h-index
1 publications
26 citations
1–8 of 16
1 publications · 37 citations
1
h-index
1 publications · 77 citations
1
h-index
1 publications · 20 citations
1
h-index
1 publications · 28 citations
1
h-index
1 publications · 14 citations
1
h-index
1–5