An efficient algorithm to clip a 2D-polygon against a rectangular clip window

DOI10.1007/S11766-022-4556-0MaRDI QIDQ2132741zbMATH OpenOpenAlexFDO

Authors Sushil Chandra Dimri, Umesh Kumar Tiwari, Mangey Ram

Publication date 28 April 2022

Published in Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11766-022-4556-0

zbMATH Keywords

clip windowcomputational complexityline segmentpoint clippingpolygon clipping

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 987412
• scientific article; zbMATH DE number 176247
• A Speculative Approach to Clipping Line Segments
• scientific article; zbMATH DE number 1919433
• A new, fast method for 2D polygon clipping

Cites work

• A New Concept and Method for Line Clipping

Cited in

(7)

• scientific article; zbMATH DE number 987412 (Why is no real title available?)
• Line clipping against polygonal window algorithm based on the multiple virtual boxes rejecting
• A New Concept and Method for Line Clipping
• A new, fast method for 2D polygon clipping
• scientific article; zbMATH DE number 176247 (Why is no real title available?)
• scientific article; zbMATH DE number 1919433 (Why is no real title available?)
• A Brief Survey of Clipping and Intersection Algorithms with a List of References (including Triangle-Triangle Intersections)

This page was built for publication: An efficient algorithm to clip a 2D-polygon against a rectangular clip window

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