ε-Nets

Ε-Nets is a computational geometry construct that, for a given range space and probability measure, is a subset of points such that any range with measure at least ε contains a point from the subset, thereby providing a probabilistically guaranteed approximation of range space coverage.

14

Publications

691

Citations

30

Authors

26

Institutions

Publications per year

2017–2026

2

Authors

30

  1. EW
    Emo Welzl

    Freie Universität Berlin, Germany

    3 publications · 173 citations

    3

    h-index

  2. MS
    Micha Sharir

    Tel Aviv University, Israel

    3 publications · 88 citations

    3

    h-index

  3. MG
    Michelangelo Grigni

    Emory University, United States

    2 publications · 68 citations

    2

    h-index

  4. BC
    Bernard Chazelle

    Princeton University, United States

    2 publications · 68 citations

    2

    h-index

  5. CS
    Christian Sohler

    TU Dortmund University, Germany

    2 publications · 128 citations

    2

    h-index

1–5 of 30

Venues

  1. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 1 publications · 27 citations

    1

    h-index

  2. 1

    h-index

  3. Discrete & Computational Geometry

    1 publications · 49 citations

    1

    h-index

  4. Combinatorics Probability Computing

    1 publications · 124 citations

    1

    h-index

  5. Journal of the ACM

    JACM · 1 publications · 20 citations

    1

    h-index

1–5