Robust geometric computation

Vikram Sharma, Chee Yap

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Nonrobustness refers to qualitative or catastrophic failures in geometric algorithms arising from numerical errors. Section 45.1 provides background on these problems. Although nonrobustness is already an issue in “purely numerical” computation, the problem is compounded in “geometric computation.” In Section 45.2 we characterize such computations. Researchers trying to create robust geometric software have tried two approaches: making fixed-precision computation robust (Section 45.3), and making the exact approach viable (Section 45.4). Another source of nonrobustness is the phenomenon of degenerate inputs. General methods for treating degenerate inputs are described in Section 45.5. For some problems the exact approach may be expensive or infeasible. To ensure robustness in this setting, a recent extension of exact computation, the so-called “soft exact approach,” has been proposed. This is described in Section 45.6.

Original languageEnglish (US)
Title of host publicationHandbook of Discrete and Computational Geometry, Third Edition
PublisherCRC Press
Pages1189-1223
Number of pages35
ISBN (Electronic)9781498711425
ISBN (Print)9781498711395
DOIs
StatePublished - Jan 1 2017

Fingerprint

Geometric Algorithms
Exact Computation
Numerical Computation
Robustness
Software
Background

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

Cite this

Sharma, V., & Yap, C. (2017). Robust geometric computation. In Handbook of Discrete and Computational Geometry, Third Edition (pp. 1189-1223). CRC Press. https://doi.org/10.1201/9781315119601

Robust geometric computation. / Sharma, Vikram; Yap, Chee.

Handbook of Discrete and Computational Geometry, Third Edition. CRC Press, 2017. p. 1189-1223.

Research output: Chapter in Book/Report/Conference proceedingChapter

Sharma, V & Yap, C 2017, Robust geometric computation. in Handbook of Discrete and Computational Geometry, Third Edition. CRC Press, pp. 1189-1223. https://doi.org/10.1201/9781315119601
Sharma V, Yap C. Robust geometric computation. In Handbook of Discrete and Computational Geometry, Third Edition. CRC Press. 2017. p. 1189-1223 https://doi.org/10.1201/9781315119601
Sharma, Vikram ; Yap, Chee. / Robust geometric computation. Handbook of Discrete and Computational Geometry, Third Edition. CRC Press, 2017. pp. 1189-1223
@inbook{9af357f978944e1b8290a1a513b0fe23,
title = "Robust geometric computation",
abstract = "Nonrobustness refers to qualitative or catastrophic failures in geometric algorithms arising from numerical errors. Section 45.1 provides background on these problems. Although nonrobustness is already an issue in “purely numerical” computation, the problem is compounded in “geometric computation.” In Section 45.2 we characterize such computations. Researchers trying to create robust geometric software have tried two approaches: making fixed-precision computation robust (Section 45.3), and making the exact approach viable (Section 45.4). Another source of nonrobustness is the phenomenon of degenerate inputs. General methods for treating degenerate inputs are described in Section 45.5. For some problems the exact approach may be expensive or infeasible. To ensure robustness in this setting, a recent extension of exact computation, the so-called “soft exact approach,” has been proposed. This is described in Section 45.6.",
author = "Vikram Sharma and Chee Yap",
year = "2017",
month = "1",
day = "1",
doi = "10.1201/9781315119601",
language = "English (US)",
isbn = "9781498711395",
pages = "1189--1223",
booktitle = "Handbook of Discrete and Computational Geometry, Third Edition",
publisher = "CRC Press",

}

TY - CHAP

T1 - Robust geometric computation

AU - Sharma, Vikram

AU - Yap, Chee

PY - 2017/1/1

Y1 - 2017/1/1

N2 - Nonrobustness refers to qualitative or catastrophic failures in geometric algorithms arising from numerical errors. Section 45.1 provides background on these problems. Although nonrobustness is already an issue in “purely numerical” computation, the problem is compounded in “geometric computation.” In Section 45.2 we characterize such computations. Researchers trying to create robust geometric software have tried two approaches: making fixed-precision computation robust (Section 45.3), and making the exact approach viable (Section 45.4). Another source of nonrobustness is the phenomenon of degenerate inputs. General methods for treating degenerate inputs are described in Section 45.5. For some problems the exact approach may be expensive or infeasible. To ensure robustness in this setting, a recent extension of exact computation, the so-called “soft exact approach,” has been proposed. This is described in Section 45.6.

AB - Nonrobustness refers to qualitative or catastrophic failures in geometric algorithms arising from numerical errors. Section 45.1 provides background on these problems. Although nonrobustness is already an issue in “purely numerical” computation, the problem is compounded in “geometric computation.” In Section 45.2 we characterize such computations. Researchers trying to create robust geometric software have tried two approaches: making fixed-precision computation robust (Section 45.3), and making the exact approach viable (Section 45.4). Another source of nonrobustness is the phenomenon of degenerate inputs. General methods for treating degenerate inputs are described in Section 45.5. For some problems the exact approach may be expensive or infeasible. To ensure robustness in this setting, a recent extension of exact computation, the so-called “soft exact approach,” has been proposed. This is described in Section 45.6.

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

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

U2 - 10.1201/9781315119601

DO - 10.1201/9781315119601

M3 - Chapter

SN - 9781498711395

SP - 1189

EP - 1223

BT - Handbook of Discrete and Computational Geometry, Third Edition

PB - CRC Press

ER -