Concepedia

Simulation Of Simplicity

Simulation of Simplicity is a computational technique in robust geometric computation that systematically removes degeneracies in geometric algorithms by introducing symbolic perturbations to input data, thereby simulating a scenario where general position is always maintained without explicitly altering the underlying geometry.

3

Publications

871

Citations

6

Authors

5

Institutions

Publications per year

2017–2026

1

Parents

Publications

3

1–3 of 3

Authors

6

  1. HE
    Herbert Edelsbrunner

    University of Illinois Urbana-Champaign, United States

    2 publications · 830 citations

    2

    h-index

  2. EP
    Ernst P. Mücke

    University of Illinois Urbana-Champaign, United States

    2 publications · 830 citations

    2

    h-index

  3. HW
    Huanling Wang

    Hohai University, China

    1 publications · 41 citations

    1

    h-index

  4. WX
    Weiya Xu

    Hohai University, China

    1 publications · 41 citations

    1

    h-index

  5. QM
    Qingxiang Meng

    Hohai University, China

    1 publications · 41 citations

    1

    h-index

1–5 of 6

Institutions

5

  1. University of Illinois Urbana-Champaign

    Urbana, United States

    2 h-index

    4 publications

    1.7K citations

  2. Ministry of Education and Child Care

    Victoria, Canada

    1 h-index

    1 publications

    41 citations

  3. Hohai University

    Nanjing, China

    1 h-index

    4 publications

    164 citations

  4. University of Toronto

    Toronto, Canada

    1 h-index

    1 publications

    41 citations

  5. University of Waterloo

    Waterloo, Canada

    1 h-index

    1 publications

    41 citations

1–5 of 5

Venues

  1. ACM Transactions on Graphics

    TOG · 1 publications · 713 citations

    1

    h-index

  2. Engineering Computations

    1 publications · 41 citations

    1

    h-index

1–2