Computational geometry: an introduction
Computational geometry: an introduction
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
An efficient algorithm for line and polygon clipping
The Visual Computer: International Journal of Computer Graphics
A generic solution to polygon clipping
Communications of the ACM
An analysis and algorithm for polygon clipping
Communications of the ACM
Communications of the ACM
Hidden surface removal using polygon area sorting
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
IEEE Computer Graphics and Applications
A visible polygon reconstruction algorithm
SIGGRAPH '81 Proceedings of the 8th annual conference on Computer graphics and interactive techniques
Polygon comparison using a graph representation
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Computing and Managing Cardinal Direction Relations
IEEE Transactions on Knowledge and Data Engineering
An algorithm for polygon clipping, and for determining polygon intersections and unions
Computers & Geosciences
Random-access rendering of general vector graphics
ACM SIGGRAPH Asia 2008 papers
A new algorithm for computing Boolean operations on polygons
Computers & Geosciences
Modeling of fresh concrete flow
Computers and Structures
Wireless array based sensor relocation in mobile sensor networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Computers and Electronics in Agriculture
Technical section: A new algorithm for Boolean operations on general polygons
Computers and Graphics
Industrial strength polygon clipping: A novel algorithm with applications in VLSI CAD
Computer-Aided Design
Algorithms for vector graphic optimization and compression
CGI'06 Proceedings of the 24th international conference on Advances in Computer Graphics
An efficient algorithm for clipping operation based on trapezoidal meshes and sweep-line technique
Advances in Engineering Software
A unified method for invalid 2D loop removal in tool-path generation
Computer-Aided Design
Collision free region determination by modified polygonal Boolean operations
Computer-Aided Design
A simple algorithm for Boolean operations on polygons
Advances in Engineering Software
Algorithm 932: PANG: Software for nonmatching grid projections in 2D and 3D with linear complexity
ACM Transactions on Mathematical Software (TOMS)
| Hi-index | 0.00 |
Clipping 2D polygons is one of the basic routines in computer graphics. In rendering complex 3D images it has to be done several thousand times. Efficient algorithms are therefore very important. We present such an efficient algorithm for clipping arbitrary 2D-polygons. The algorithm can handle arbitrary closed polygons, specifically where the clip and subject polygons may self-intersect. The algoirthm is simple and faster that Vatti's (1992) algorithm, which was designed for the general case as well. Simple modifications allow determination of union and set-theoretic differences of two arbitrary polygons.