Clipping simple polygons with degenerate intersections
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 co...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2019-12-01
|
| Series: | Computers & Graphics: X |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S259014861930007X |