Constructive root bound for k-ary rational input numbers

Sylvain Pion, Chee K. Yap

Research output: Contribution to conferencePaperpeer-review


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)
Number of pages8
StatePublished - 2003
EventNineteenth Annual Symposium on Computational Geometry - san Diego, CA, United States
Duration: Jun 8 2003Jun 10 2003


OtherNineteenth Annual Symposium on Computational Geometry
Country/TerritoryUnited States
Citysan Diego, CA


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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics


Dive into the research topics of 'Constructive root bound for k-ary rational input numbers'. Together they form a unique fingerprint.

Cite this