Verifiable implementations of geometric algorithms using finite precision arithmetic

Research output: Contribution to journalArticle

61 Scopus citations

Abstract

Two methods are proposed for correct and verifiable geometric reasoning using finite precision arithmetic. The first method, data normalization, transforms the geometric structure into a configuration for which all finite precision calculations yield correct answers. The second method, called the hidden variable method, constructs configurations that belong to objects in an infinite precision domain-without actually representing these infinite precision objects. Data normalization is applied to the problem of modeling polygonal regions in the plane, and the hidden variable method is used to calculate arrangements of lines.

Original languageEnglish (US)
Pages (from-to)377-401
Number of pages25
JournalArtificial Intelligence
Volume37
Issue number1-3
DOIs
StatePublished - Dec 1988
Externally publishedYes

ASJC Scopus subject areas

  • Language and Linguistics
  • Linguistics and Language
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Verifiable implementations of geometric algorithms using finite precision arithmetic'. Together they form a unique fingerprint.

  • Cite this