A new, fast method for 2D polygon clipping

DOI10.1145/130881.130894MaRDI QIDQ4032294zbMATH OpenOpenAlexFDO

Authors Patrick-Gilles Maillot

Publication date 1 April 1993

Published in ACM Transactions on Graphics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/130881.130894

zbMATH Keywords

polygon clippingdisplay algorithmpicture image generation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 176247
• A Speculative Approach to Clipping Line Segments
• scientific article; zbMATH DE number 1919433
• An efficient algorithm to clip a 2D-polygon against a rectangular clip window
• A New Concept and Method for Line Clipping

Cited in

(7)

• A general method for decomposing self-intersecting polygon to normal based on self-intersection points
• An efficient algorithm to clip a 2D-polygon against a rectangular clip window
• scientific article; zbMATH DE number 176247 (Why is no real title available?)
• scientific article; zbMATH DE number 1919433 (Why is no real title available?)
• Line clipping against polygonal window algorithm based on the multiple virtual boxes rejecting
• A Brief Survey of Clipping and Intersection Algorithms with a List of References (including Triangle-Triangle Intersections)
• Extension of the Nicholls-Lee-Nichols algorithm to three dimensions

This page was built for publication: A new, fast method for 2D polygon clipping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032294)