ACM Home Page
Please provide us with feedback. Feedback
Efficient exact arithmetic for computational geometry
Full text PdfPdf (982 KB)
Source Annual Symposium on Computational Geometry archive
Proceedings of the ninth annual symposium on Computational geometry table of contents
San Diego, California, United States
Pages: 163 - 172  
Year of Publication: 1993
ISBN:0-89791-582-8
Authors
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 54,   Citation Count: 29
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/160985.161015
What is a DOI?

ABSTRACT

We experiment with exact integer arithmetic to implement primitives for geometric algorithms. Naive use of exact arithmetic—either modular or multiprecision integer—increases execution time dramatically over the use of floating-point arithmetic. By combining tuned multiprecision integer arithmetic and a floating-point filter based on interval analysis, we can obtain the effect of exact integer arithmetic at a cost close to that of floating-point arithmetic. We describe an experimental expression compiler that conveniently packages our techniques.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
E. H. Bareiss, Computational solution of matrix problems over an integral domain, j. Inst. Maths Applics 10:68-104, 1972.
 
2
J. L. Bentley, B. Kernighan, C. Van Wyk, An elementary C cost model, UNIX Review 9(2):38-48, 1991.
 
3
K.L. Clarkson, Safe and effective determinant evaluation, 33th Syrup. on Found. Comp. $ci. 387-395, 1992.
 
4
5
 
6
S. J. Fortune, Voronoi diagrams and Delaunay triangulations, Euclidean Geometry and Computers, World Scientific Publishing Co., D.A. Du, F.K. Hwang, eds., 1992.
7
 
8
9
 
10
D. E. Knuth, $eminumerical Algorithms, Volume 2 of The Art of Computer Programming, 2d ed., Addison-Wesley, 1981.
 
11
C.L. Lawson, Software for e1 surface interpolation, Mathematical Software III 161-194, J.R. Rice, ed., Academic Press, 1977.
 
12
 
13
 
14
B. Serpette, J. Vuillemin, J.C. Hervd. BigNum: a portable and efficient package k)r arbitraryprecision arithmetic, INRIA.
 
15
M. Shamos, D. Hoey, Closest-point problems, Pvoc. 16th Ann. Symp. Found. Comp. Sci. 151-162, 1975.
 
16
K. Sugihara, M. Iri, Geometric algorithms in finiteprecision arithmetic, Research Memorandum RMI 88-10, University of Tokyo, September, 1988.
 
17
K. Sugihara, M. Iri, Construction of the Voronoi diagram for one million generators in single precision arithmetic, First Canadian Conference on Computational Geometry, Montreal, Canada, 1989.

CITED BY  29

Collaborative Colleagues:
Steven Fortune: colleagues
Christopher J. Van Wyk: colleagues