Greiner–Hormann clipping algorithm
id:
greiner-hormann-clipping-algorithm-317-12291670
title:
Greiner–Hormann clipping algorithm
text:
The Greiner-Hormann algorithm is used in computer graphics for polygon clipping. It performs better than the Vatti clipping algorithm, but cannot handle degeneracies. It can process both self-intersecting and non-convex polygons. It can be trivially generalized to compute other Boolean operations on polygons, such as union and difference. The algorithm is based on the definition of the "inside" of a polygon based on the winding number. It considers regions with odd winding number to be inside th
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Greiner%E2%80%93Hormann_clipping_algorithm
date created:
date modified:
2023-08-13T05:34:12Z
main entity:
{"identifier":"Q17083989","url":"https://www.wikidata.org/entity/Q17083989"}
image:
fields total:
13
integrity:
13