提出了一种闭域包含点检测算法,对曲线边先进行包含测试,再找到相交线段。其中对抛物曲线段用二分查找法找到相交线段。由于曲边数远小于逼近多边形的边数n·m,该算法时间复杂度仅为o(n·In m),加快了检测速度。
An algebraic algorithm reformed paper is presented.When running it,point-in-segment inclusion query did befoge finding intersect segment or using dichotomy to find to parabola segment. The algorithm complexity is o (n. In m), and accelerates the test for n〈〈n.m.