DocumentCode :
2235834
Title :
Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic
Author :
Milenkovic, Victor
Author_Institution :
Harvard Univ., Cambridge, MA, USA
fYear :
1989
fDate :
30 Oct-1 Nov 1989
Firstpage :
500
Lastpage :
505
Abstract :
For the first time it is shown how to reduce the cost of performing specific geometric constructions by using rounded arithmetic instead of exact arithmetic. By exploiting a property of floating-point arithmetic called monotonicity, a technique called double-precision geometry can replace exact arithmetic with rounded arithmetic in any efficient algorithm for computing the set of intersections of a set of lines or line segments. The technique reduces the complexity of any such line or segment arrangement algorithm by a constant factor. In addition, double-precision geometry reduces by a factor of N the complexity of rendering segment arrangements on a 2N×2 N integer grid such that output segments have grid points as endpoints
Keywords :
computational complexity; computational geometry; digital arithmetic; error analysis; roundoff errors; double-precision geometry; floating-point arithmetic; geometric constructions; monotonicity; rounded arithmetic; segment arrangement algorithm; Computational geometry; Computers; Costs; Equations; Failure analysis; Floating-point arithmetic; Hardware; Numerical analysis; Robustness; Standards development;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1989., 30th Annual Symposium on
Conference_Location :
Research Triangle Park, NC
Print_ISBN :
0-8186-1982-1
Type :
conf
DOI :
10.1109/SFCS.1989.63525
Filename :
63525
Link To Document :
بازگشت