Constructive root bound for k-ary rational input numbers

Sylvain Pion, Chee Yap

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Constructive root bounds is the fundamental technique needed to achieve guaranteed accuracy, the critical capability in Exact Geometric Computation. Known bounds are overly pessimistic in the presense of general rational input numbers. In this paper, we introduce a method which greatly improves the known bounds for k-ary rational input numbers. Since majority of input numbers in scientific and engineering applications are such numbers, this could lead to a significant speedup for a large class of applications. We apply our method to the BFMSS Bound. Implementation and experimental results based on the Core Library are reported.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual Symposium on Computational Geometry
Pages256-263
Number of pages8
Publication statusPublished - 2003
EventNineteenth Annual Symposium on Computational Geometry - san Diego, CA, United States
Duration: Jun 8 2003Jun 10 2003

Other

OtherNineteenth Annual Symposium on Computational Geometry
CountryUnited States
Citysan Diego, CA
Period6/8/036/10/03

    Fingerprint

Keywords

  • Constructive root bounds
  • Exact geometric computation
  • k-ary rational numbers
  • Robust numerical algorithms

ASJC Scopus subject areas

  • Chemical Health and Safety
  • Software
  • Safety, Risk, Reliability and Quality
  • Geometry and Topology

Cite this

Pion, S., & Yap, C. (2003). Constructive root bound for k-ary rational input numbers. In Proceedings of the Annual Symposium on Computational Geometry (pp. 256-263)