Constructive root bound for k-ary rational input numbers

Sylvain Pion, Chee Yap

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)361-376
Number of pages16
JournalTheoretical Computer Science
Volume369
Issue number1-3
DOIs
StatePublished - Dec 15 2006

Fingerprint

Roots
Exact Geometric Computation
Geometric Algorithms
Robust Algorithm
Engineering Application
Speedup
Paradigm
Binary
Experimental Results

Keywords

  • Constructive root bounds
  • Exact geometric computation
  • k-Ary rational numbers
  • Robust numerical algorithms

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Constructive root bound for k-ary rational input numbers. / Pion, Sylvain; Yap, Chee.

In: Theoretical Computer Science, Vol. 369, No. 1-3, 15.12.2006, p. 361-376.

Research output: Contribution to journalArticle

@article{0b71fcc9077f404783c8ea5330329680,
title = "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.",
keywords = "Constructive root bounds, Exact geometric computation, k-Ary rational numbers, Robust numerical algorithms",
author = "Sylvain Pion and Chee Yap",
year = "2006",
month = "12",
day = "15",
doi = "10.1016/j.tcs.2006.09.010",
language = "English (US)",
volume = "369",
pages = "361--376",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Constructive root bound for k-ary rational input numbers

AU - Pion, Sylvain

AU - Yap, Chee

PY - 2006/12/15

Y1 - 2006/12/15

N2 - 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.

AB - 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.

KW - Constructive root bounds

KW - Exact geometric computation

KW - k-Ary rational numbers

KW - Robust numerical algorithms

UR - http://www.scopus.com/inward/record.url?scp=33751020582&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33751020582&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2006.09.010

DO - 10.1016/j.tcs.2006.09.010

M3 - Article

VL - 369

SP - 361

EP - 376

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-3

ER -