Controlled perturbation for arrangements of circles

Dan Halperin*, Eran Leiserowitz

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review


Given a collection C of circles in the plane, we wish to construct the arrangement A(C) (namely the subdivision of the plane into vertices, edges and faces induced by C) using floating point arithmetic. We present an efficient scheme, controlled perturbation, that perturbs the circles in C slightly to form a collection C′, so that all the predicates that arise in the construction of A(C′) are computed accurately and A(C′) is degeneracy free. We introduced controlled perturbation several years ago, and already applied it to certain types of arrangements. The major contribution of the current work is the derivation of a good (small) resolution bound, that is, a bound on the minimum separation of features of the arrangement that is required to guarantee that the predicates involved in the construction can be safely computed with the given (limited) precision arithmetic. A smaller resolution bound leads to smaller perturbation of the original input. We present the scheme, describe how the resolution bound is determined and how it effects the perturbation magnitude. We implemented the perturbation scheme and the construction of the arrangement and we report on experimental results.

Original languageEnglish
Number of pages10
StatePublished - 2003
EventNineteenth Annual Symposium on Computational Geometry - san Diego, CA, United States
Duration: 8 Jun 200310 Jun 2003


ConferenceNineteenth Annual Symposium on Computational Geometry
Country/TerritoryUnited States
Citysan Diego, CA


  • Arrangements
  • Perturbation
  • Robustness


Dive into the research topics of 'Controlled perturbation for arrangements of circles'. Together they form a unique fingerprint.

Cite this