返回
Reliable line segment intersection testing
DOI:10.1016/S0010-4485(00)00050-6.png)
摘要
En 中文
The main result of this paper is a new algorithm that tests whether two line segments in the plane intersect. If the segments are defined using the coordinates of the endpoints in single-precision floating-point arithmetic, then the result of the test is exact. The equations of the segments are given in parametric form using the endpoint coordinates, and an equation whose solution would provide the coordinates of the intersection is developed. Interval arithmetic is then used to compute an inclusion of the coordinates of the intersection point. This inclusion is often sufficient to decide the intersection test. When it is not, a method for determining the exact sign of a sum is applied to the equations at an earlier stage of the solution process. Experimental results are presented that show that the number of intersections that cannot be resolved using interval tools is Fairly large in close to degenerate configurations of the segments and that the algorithm is significantly faster than an algorithm implemented using exact arithmetic. (C) 2000 Elsevier Science Ltd. All rights reserved.
Keyword:
intersection testing for line segments
floating-point arithmetic
exact computation
interval arithmetic
interval filter
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.1
论文数:
3.1K
被引数:
6.4K
机构
暂无机构信息
引用论文
Adaptive Control System Design and Experiment Study of Gas Flow Regulation System for Variable Flow Ducted Rockets
Aerospace
IF0
Synthesis of New Donor-functionalized Alcohols as Organic Ligands for Metal Precursors of Metal Organic Chemical Vapor Deposition新型供体功能化醇类作为金属有机化学气相沉积金属前驱体有机配体的合成
没有更多内容

