Randomized Line Arrangement Algorithms

Randomized Line Arrangement Algorithms is a class of randomized geometric algorithms that constructs and analyzes arrangements of lines in the plane by employing random sampling or iterative perturbation to achieve efficient expected complexity and probabilistic guarantees in computational geometry.

9

Publications

322

Citations

14

Authors

13

Institutions

Publications per year

2017–2026

0

Authors

14

  1. LG
    Leonidas Guibas

    Stanford University, United States

    3 publications · 102 citations

    3

    h-index

  2. DH
    David H. Marimont

    Palo Alto Research Center, United States

    2 publications · 68 citations

    2

    h-index

  3. HW
    Haitao Wang

    Tsinghua University, China

    1 publications · 19 citations

    1

    h-index

  4. PB
    Prosenjit Bose

    Carleton University, Canada

    1 publications · 83 citations

    1

    h-index

  5. SH
    Sariel Har-Peled

    University of Illinois Urbana-Champaign, United States

    1 publications · 32 citations

    1

    h-index

1–5 of 14

Venues

  1. SIAM Journal on Computing

    2 publications · 80 citations

    2

    h-index

  2. Journal of Combinatorial Theory Series A

    1 publications · 24 citations

    1

    h-index

  3. Information Processing Letters

    1 publications · 19 citations

    1

    h-index

  4. Computational Geometry

    1 publications · 83 citations

    1

    h-index

  5. 1

    h-index

1–5