Skip to Main content Skip to Navigation
Conference papers

Constructive Root Bound for k-Ary Rational Input Numbers

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 presence 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.
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Sylvain Pion Connect in order to contact the contributor
Submitted on : Saturday, December 20, 2008 - 9:07:45 PM
Last modification on : Tuesday, October 19, 2021 - 11:05:58 AM
Long-term archiving on: : Thursday, October 11, 2012 - 2:45:37 PM


Files produced by the author(s)


  • HAL Id : inria-00348715, version 1



Sylvain Pion, Chee Yap. Constructive Root Bound for k-Ary Rational Input Numbers. 19th Annual ACM Symposium on Computational Geometry (SCG), Jun 2003, San Diego, California, United States. pp.256-263. ⟨inria-00348715⟩



Record views


Files downloads