Clipping simple polygons with degenerate intersections

Erich L Foster, Kai Hormann, Romeo Traian Popa

Research output: Contribution to journalArticleScientificpeer-review

8 Citations (Scopus)


Polygon clipping is a frequent operation in many fields, including computer graphics, CAD, and GIS. Thus, efficient and general polygon clipping algorithms are of great importance. Greiner and Hormann (1998) propose a simple and time-efficient algorithm that can clip arbitrary polygons, including concave and self-intersecting polygons with holes. However, the Greiner–Hormann algorithm does not properly handle degenerate intersection cases, without the undesirable need for perturbing vertices. We present an extension of the Greiner–Hormann polygon clipping algorithm that properly deals with such degenerate cases.
Original languageEnglish
Article number100007
JournalComputers & Graphics: X
Publication statusPublished - 2019
Externally publishedYes


Dive into the research topics of 'Clipping simple polygons with degenerate intersections'. Together they form a unique fingerprint.

Cite this