A new algorithm for Boolean operations on general polygons

	A new algorithm for Boolean operations on general polygons
	Peng, Yu 1; Yong, Jun-Hai 2; Dong, Weiming1 ; Zhang, Hui 2; Sun, Jia-Guang 1,2
刊名	Computers & Graphics
	2005-02
卷号	29 期号:1 页码:57-70
关键词	Curve, surface, solid, and object representations Geometric algorithms, languages, and systems Modeling packages Computational geometry Geometric modeling Boolean operation Polygon intersection
通讯作者	Peng, Yu
英文摘要	A new algorithm for Boolean operations on general planar polygons is presented. It is available for general planar polygons (manifold or non-manifold, with or without holes). Edges of the two general polygons are subdivided at the intersection points and touching points. Thus, the boundaryof the Boolean operation resultant polygon is made of some whole edges of the polygons after the subdivision process. We use the simplex theory to build the basic mathematical model of the new algorithm. The subordination problem between an edge and a polygon is reduced to a problem of determining whether a point is on some edges of some simplices or inside the simplices, and the associated simplicial chain of the resultant polygon is just an assembly of some simplices and their coefficients of the two polygons after the subdivision process. Examples show that the running time required bythe new algorithm is less than one-third of that bythe Rivero and Feito algorithm.
收录类别	SCI
内容类型	期刊论文
源URL	[http://ir.ia.ac.cn/handle/173211/13119]
专题	自动化研究所_09年以前成果
作者单位	1.Department of Computer Science and Technology, Tsinghua University 2.School of Software, Tsinghua University
推荐引用方式 GB/T 7714	Peng, Yu,Yong, Jun-Hai,Dong, Weiming,et al. A new algorithm for Boolean operations on general polygons[J]. Computers & Graphics,2005,29(1):57-70.
APA	Peng, Yu,Yong, Jun-Hai,Dong, Weiming,Zhang, Hui,&Sun, Jia-Guang.(2005).A new algorithm for Boolean operations on general polygons.Computers & Graphics,29(1),57-70.
MLA	Peng, Yu,et al."A new algorithm for Boolean operations on general polygons".Computers & Graphics 29.1(2005):57-70.