Controlled linear perturbation

Elisha Sacks, Victor Milenkovic, Min Ho Kyung

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


We present an algorithmic solution to the robustness problem in computational geometry, called controlled linear perturbation, and demonstrate it on Minkowski sums of polyhedra. The robustness problem is how to implement real RAM algorithms accurately and efficiently using computer arithmetic. Approximate computation in floating point arithmetic is efficient but can assign incorrect signs to geometric predicates, which can cause combinatorial errors in the algorithm output. We make approximate computation accurate by performing small input perturbations, which we compute using differential calculus. This strategy supports fast, accurate Minkowski sum computation. The only prior robust implementation uses a less efficient algorithm, requires exact algebraic computation, and is far slower based on our extensive testing.

Original languageEnglish (US)
Pages (from-to)1250-1257
Number of pages8
JournalCAD Computer Aided Design
Issue number10
StatePublished - Oct 2011


  • Perturbation methods
  • Robust computational geometry

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design
  • Industrial and Manufacturing Engineering


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

Cite this