摘要
为了快速准确地求出多边形之间的交集提出了一种求取带孔洞多边形交集的新算法.把待求的有孔洞多边形分解为若干个实心多边形,每步只对两个实心多边形进行交、并、差集运算不仅简化了多边形的数据结构,而且还降低了运算的复杂度,提高了运算速度.
In order to compute the intersection of polygons rapidly and correctly,t his paper pus forward an al-gorithmfor intersection of polygon s with holes.The polygons with holes was decomposed into several solid polygons and each time two solid polygons were dealt with,which not only decreases the computa tion complication,but also simplifies the data structure of polygon and improves the computation sp eed.
出处
《沈阳工业大学学报》
EI
CAS
2001年第5期429-431,共3页
Journal of Shenyang University of Technology
