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.
Type de document :
Communication dans un congrès
19th Annual ACM Symposium on Computational Geometry (SCG), Jun 2003, San Diego, California, United States. pp.256-263, 2003
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00348715
Contributeur : Sylvain Pion <>
Soumis le : samedi 20 décembre 2008 - 21:07:45
Dernière modification le : samedi 27 janvier 2018 - 01:31:48
Document(s) archivé(s) le : jeudi 11 octobre 2012 - 14:45:37

Fichier

p093-pion.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00348715, version 1

Collections

Citation

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, 2003. 〈inria-00348715〉

Partager

Métriques

Consultations de la notice

166

Téléchargements de fichiers

115