Constructive Root Bound for k-Ary Rational Input Numbers - Archive ouverte HAL Access content directly
Conference Papers Year : 2003

Constructive Root Bound for k-Ary Rational Input Numbers

(1, 2) , (2)
1
2

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

Dates and versions

inria-00348715 , version 1 (20-12-2008)

Identifiers

  • HAL Id : inria-00348715 , version 1

Cite

Sylvain Pion, Chee K. 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⟩

Collections

INRIA INRIA2
73 View
148 Download

Share

Gmail Facebook Twitter LinkedIn More