Computer-Aided Design and Applications vol. 3, no. 1-4, pp. 447 - 456
We present an extension of Greiner-Hormann polygon clipping that has been regarded as both computationally efficient and simple to implement. This extended version of the Greiner-Hormann polygon clipping elegantly handles the degenerate cases in a deterministic way, which in the previous approach is done by perturbing vertices in an indeterministic way.