Controlled linear perturbation

Elisha Sacks, Victor Milenkovic, Min Ho Kyung

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

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
Volume43
Issue number10
DOIs
StatePublished - Oct 2011

Fingerprint

Differentiation (calculus)
Digital arithmetic
Computational geometry
Random access storage
Testing

Keywords

  • Perturbation methods
  • Robust computational geometry

ASJC Scopus subject areas

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

Cite this

Controlled linear perturbation. / Sacks, Elisha; Milenkovic, Victor; Kyung, Min Ho.

In: CAD Computer Aided Design, Vol. 43, No. 10, 10.2011, p. 1250-1257.

Research output: Contribution to journalArticle

Sacks, Elisha ; Milenkovic, Victor ; Kyung, Min Ho. / Controlled linear perturbation. In: CAD Computer Aided Design. 2011 ; Vol. 43, No. 10. pp. 1250-1257.
@article{f68f045a6e234781b5d335c5939ec01d,
title = "Controlled linear perturbation",
abstract = "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.",
keywords = "Perturbation methods, Robust computational geometry",
author = "Elisha Sacks and Victor Milenkovic and Kyung, {Min Ho}",
year = "2011",
month = "10",
doi = "10.1016/j.cad.2011.06.015",
language = "English (US)",
volume = "43",
pages = "1250--1257",
journal = "CAD Computer Aided Design",
issn = "0010-4485",
publisher = "Elsevier Limited",
number = "10",

}

TY - JOUR

T1 - Controlled linear perturbation

AU - Sacks, Elisha

AU - Milenkovic, Victor

AU - Kyung, Min Ho

PY - 2011/10

Y1 - 2011/10

N2 - 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.

AB - 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.

KW - Perturbation methods

KW - Robust computational geometry

UR - http://www.scopus.com/inward/record.url?scp=80052944586&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80052944586&partnerID=8YFLogxK

U2 - 10.1016/j.cad.2011.06.015

DO - 10.1016/j.cad.2011.06.015

M3 - Article

AN - SCOPUS:80052944586

VL - 43

SP - 1250

EP - 1257

JO - CAD Computer Aided Design

JF - CAD Computer Aided Design

SN - 0010-4485

IS - 10

ER -