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

Authors

22

  1. IS
    Ivan Stojmenović

    University of Ottawa, Canada

    2 publications · 43 citations

    2

    h-index

  2. SR
    Stefan Rührup

    University of Ottawa, Canada

    2 publications · 43 citations

    2

    h-index

  3. PH
    Pengcheng Hu

    Huazhong University of Science and Technology, China

    1 publications · 24 citations

    1

    h-index

  4. MS
    Manuel Schmitz

    University of Stuttgart, Germany

    1 publications · 37 citations

    1

    h-index

  5. GB
    Gerardo Bandera

    Universidad de Málaga, Spain

    1 publications · 14 citations

    1

    h-index

1–5 of 22

Venues

  1. Acta Astronautica

    1 publications · 37 citations

    1

    h-index

  2. Computer-Aided Design and Applications

    1 publications · 77 citations

    1

    h-index

  3. 1

    h-index

  4. IEEE Transactions on Computers

    1 publications · 28 citations

    1

    h-index

  5. 1

    h-index

1–5