Skip to Main content Skip to Navigation
Journal articles

Constructive root bound for k-ary rational input numbers

Abstract : Guaranteeing accuracy is the critical capability in exact geometric computation, an important paradigm for constructing robust geometric algorithms. Constructive root bounds is the fundamental technique needed to achieve such guaranteed accuracy. Current 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 a majority of input numbers in scientific and engineering applications are either binary (k =2) or decimal (k =10), our results could lead to a significant speedup for a large class of applications. We apply our method to two of the best available constructive root bounds, the BFMSS Bound and the Degree-Measure Bound. Implementation and experimental results based on the Core Library are reported.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Sylvain Pion Connect in order to contact the contributor
Submitted on : Thursday, December 4, 2008 - 4:03:46 PM
Last modification on : Tuesday, October 19, 2021 - 11:05:58 AM
Long-term archiving on: : Monday, June 7, 2010 - 11:44:40 PM


Files produced by the author(s)




Sylvain Pion, Chee Yap. Constructive root bound for k-ary rational input numbers. Theoretical Computer Science, Elsevier, 2006, 369 (1-3), pp.361-376. ⟨10.1016/j.tcs.2006.09.010⟩. ⟨inria-00344349⟩



Record views


Files downloads