.png){kind=icon}
返回
Controlled linear perturbation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cad.2011.06.015.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present an algorithmic solution to the robustness problem in computational geometry, called controlled linear perturbation, and demonstrate it on Minkowski sums of polyhedra. The robustness problem is how to implement real RAM algorithms accurately and efficiently using computer arithmetic. Approximate computation in floating point arithmetic is efficient but can assign incorrect signs to geometric predicates, which can cause combinatorial errors in the algorithm output. We make approximate computation accurate by performing small input perturbations, which we compute using differential calculus. This strategy supports fast, accurate Minkowski sum computation. The only prior robust implementation uses a less efficient algorithm, requires exact algebraic computation, and is far slower based on our extensive testing. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Robust computational geometry
Perturbation methods
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.1
论文数:
3.1K
被引数:
6.4K
机构
引用论文
.png){kind=icon}
A teacher professional development programme to enhance students’ critical health literacy through school-based health and physical education programmes一项旨在通过基于学校的健康与体育教育项目提升学生批判性健康素养的教师专业发展计划
PREAI
分享收藏分享收藏
查看更多内容