Constructive root bound for k-ary rational input numbers - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2006

Constructive root bound for k-ary rational input numbers

(1) , (2)
1
2

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.
Fichier principal
Vignette du fichier
p.pdf (272.84 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00344349 , version 1 (04-12-2008)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More