A Speculative Approach to Clipping Line Segments

DOI10.1007/11751540_15MaRDI QIDQ5505330zbMATH OpenOpenAlexFDO

Authors Frank Dévai

Publication date 27 January 2009

Published in Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11751540_15

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 987412
• A New Concept and Method for Line Clipping
• Line clipping against polygonal window algorithm based on the multiple virtual boxes rejecting
• scientific article; zbMATH DE number 176247
• A fast planar partition algorithm, II

Cited in

(7)

• An efficient algorithm to clip a 2D-polygon against a rectangular clip window
• 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
• Line clipping based on parallelism approach and midpoint intersection
• A Brief Survey of Clipping and Intersection Algorithms with a List of References (including Triangle-Triangle Intersections)

This page was built for publication: A Speculative Approach to Clipping Line Segments

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