A New Algorithm for Boolean Operations on General Polygons - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computers and Graphics Year : 2005

A New Algorithm for Boolean Operations on General Polygons

Yu Peng
  • Function : Author
Jun-Hai Yong
  • Function : Author
Hui Zhang
  • Function : Author
Jia-Guang Sun
  • Function : Author


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.
Fichier principal
Vignette du fichier
YuPeng2005a.pdf (752.87 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00517670 , version 1 (15-09-2010)



Yu Peng, Jun-Hai Yong, Wei-Ming Dong, Hui Zhang, Jia-Guang Sun. A New Algorithm for Boolean Operations on General Polygons. Computers and Graphics, 2005, 29 (1), pp.57-70. ⟨10.1016/j.cag.2004.11.001⟩. ⟨inria-00517670⟩
360 View
1729 Download



Gmail Facebook Twitter LinkedIn More