1994
DOI: 10.1016/0010-4485(94)90063-9
|View full text |Cite
|
Sign up to set email alerts
|

Error-free boundary evaluation based on a lazy rational arithmetic: a detailed implementation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
30
0

Year Published

2000
2000
2002
2002

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 32 publications
(30 citation statements)
references
References 9 publications
0
30
0
Order By: Relevance
“…Benouamer, Michelucci, and Peroche [2] implement a solid modeler using a filtered approach that differs from that of Fortune and van Wyk. Benouamer et al express each sequence of calculations as an expression dag, that is, a directed acyclic graph with operations at internal nodes and constants at the leaves.…”
Section: Literature Surveymentioning
confidence: 99%
“…Benouamer, Michelucci, and Peroche [2] implement a solid modeler using a filtered approach that differs from that of Fortune and van Wyk. Benouamer et al express each sequence of calculations as an expression dag, that is, a directed acyclic graph with operations at internal nodes and constants at the leaves.…”
Section: Literature Surveymentioning
confidence: 99%
“…Effects of this kind of the lazy evaluation strategy were reported in (Benouamer et al, 1993;Sugihara, 1997). 1.3.…”
Section: Acceleration By Lazy Evaluationmentioning
confidence: 99%
“…This principle has been used widely in numerically robust geometric computation (Ottmann et al, 1987;Sugihara and Iri, 1989;Karasick et al, 1991;Sugihara, 1992;Schorn, 1991;Benouamer et al, 1993;Fortune and von Wyk, 1993).…”
Section: Correct Judgement In Finite Precisionmentioning
confidence: 99%
See 1 more Smart Citation
“…Among the methods used to increase the efficiency of exact computations are those based on interval arithmetic [28,30], floating-point filters [18,19], lazy arithmetic [2], tuned computations [18,19], precision-driven computation [50], minimized intermediate computation [5,8], fast hardware computation [46], and modular arithmetic [5,18]. Libraries supporting basic exact computation have been developed, with LEDA [41] and CORE [29] being notable examples.…”
Section: Exact Computationmentioning
confidence: 99%