most citedAn Extension Of Weiler-Atherton Algorithm To Cope With The Self-intersecting Polygon

4 citations · 4 across the 3 of their papers we have counts for

collaborators
Showing cs.GRShow all

1 paper · 1 filter

cs.GR2014★ 4 cited

An Extension Of Weiler-Atherton Algorithm To Cope With The Self-intersecting Polygon

Anurag Chakraborty

In this paper a new algorithm has been proposed which can fix the problem of Weiler Atherton algorithm. The problem of Weiler Atherton algorithm lies in clipping self intersecting…