.png){kind=icon}
返回
Static analysis yields efficient exact integer arithmetic for computational geometry
.png){kind=icon}
OA
AI
DOI：10.1145/231731.231735.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Geometric algorithms are usually described assuming that arithmetic operations are performed exactly on real numbers. A program implemented using a naive substitution of floating-point arithmetic for real arithmetic can fail, since geometric primitives depend upon sign-evaluation and may not be reliable if evaluated approximately. Geometric primitives are reliable if evaluated exactly with integer arithmetic, but this degrades performance since software extended-precision arithmetic is required. We describe static-analysis techniques that reduce the performance cost of exact integer arithmetic used to implement geometric algorithms. We have used the techniques for a number of examples, including line-segment intersection in two dimensions, Delaunay triangulations, and a three-dimensional boundary-based polyhedral modeller. In general, the techniques are appropriate for algorithms that use primitives of relatively low algebraic total degree, e.g., those involving flat objects (points, lines, planes) in two or three dimensions. The techniques have been packaged in a preprocessor for reasonably convenient use.
Keyword:
adaptive precision
arithmetic
efficiency
exact integer arithmetic
geometric primitives
geometry
preprocessing
robustness
期刊
IF:
9.5
论文数:
4.7K
被引数:
3.6W
机构
暂无机构信息
引用论文
Pharmacodynamic considerations of collateral sensitivity in design of antibiotic treatment regimen
OAAI
OAAI分享收藏Adaptive Control System Design and Experiment Study of Gas Flow Regulation System for Variable Flow Ducted Rockets.png)
AerospaceOAAI
AerospaceIF0
OAAI分享收藏Photoelectron–Photofragment Coincidence Studies on the Dissociation Dynamics of the OH–CH4 ComplexOAAI
OAAI分享收藏 没有更多内容
没有更多内容