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

DOI10.1007/s11766-022-4556-0zbMath1499.68363OpenAlexW4221025689MaRDI QIDQ2132741

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

computational complexityline segmentclip windowpoint clippingpolygon clipping

Mathematics Subject Classification ID

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

Related Items (1)

A Brief Survey of Clipping and Intersection Algorithms with a List of References (including Triangle-Triangle Intersections)

Cites Work

• A New Concept and Method for Line Clipping

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