CAJ | 학술논문

基于点到角的最小距离提出一种判别点与多边形位置关系的新算法。通过扫描与点距离最小的线段,在多边形中有两个角共有此线段,选择其中任意一个角,定义点到此角的距离取得最小。判断点与角的内外侧关系,确定点与多边形内外侧位置关系。该算法通过点与点的距离运算避免了传统的交点、叉积的求解。比较试验表明,此新算法易于实现、计算速度快。
기우점도각적최소거리제출일충판별점여다변형위치관계적신산법。통과소묘여점거리최소적선단,재다변형중유량개각공유차선단,선택기중임의일개각,정의점도차각적거리취득최소。판단점여각적내외측관계,학정점여다변형내외측위치관계。해산법통과점여점적거리운산피면료전통적교점、차적적구해。비교시험표명,차신산법역우실현、계산속도쾌。
Give a new algorithm about point visibility for simple polygon based on the minimum distance problem of point and angle.A preprocessing is used to establish the segment that has the minimum distance with point.There are two angles in simple polygon there this segment,select any angle.A new algorithm for determining the position relation between the location of points and the angle is proposed.Algorithm did not use the cross,point of intersection operation to reduce the multiplications by finding the distance between points and line segment.Comparison experiments show that the method has a very effective computational behavior and effectiveness,and decrease the time.