摘要
通过对相交多边形交点的完备分类，给出了一个可靠的任意多边形裁剪算法．结果表明，该算法非常稳定可靠，且能处理各种奇异情况．
An effiecient algorithm for classfying intersection points between two line segments was first presented by using the property of algebraic curve. Based on this algorithm, we proposed a robust polygon clipping algorithm, which can deal with various ambiguous cases. Experiments show that the algorithm is very stable and reliable.
出处
《自动化学报》
EI
CSCD
北大核心
1996年第6期741-744,共4页
Acta Automatica Sinica
基金
国家自然科学基金
