✦ LIBER ✦

Bresenham's Line Generation Algorithm with Built-in Clipping

✍ Scribed by Yevgeny P. Kuzmin

Book ID: 114674751
Publisher: John Wiley and Sons
Year: 1995
Tongue: English
Weight: 205 KB
Volume: 14
Category: Article
ISSN: 0167-7055
DOI: 10.1111/1467-8659.1450275

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

O(lgN) line clipping algorithm in E2

✍ Václav Skala 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 480 KB

A fast algorithm for line clipping by co

A fast algorithm for line clipping by convex polyhedron in E3

✍ Václav Skala 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 621 KB

Line trap with built-in valve

📂 Article 📅 1966 🏛 Elsevier Science 🌐 English ⚖ 129 KB

An Efficient Algorithm for Line Clipping

An Efficient Algorithm for Line Clipping by Convex and Non-convex Polyhedra in E3

✍ Václav Skala 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 329 KB

An Algorithm for In-Line Generation of a

An Algorithm for In-Line Generation of a Convex Cover

✍ Denis Rutovitz 📂 Article 📅 1975 🏛 Elsevier Science ⚖ 171 KB

Industrial strength polygon clipping: A

Industrial strength polygon clipping: A novel algorithm with applications in VLSI CAD

✍ Lucanus J. Simonson 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 647 KB

We present an algorithm to compute the topology and geometry of an arbitrary number of polygon sets in the plane, also known as the map overlay. This algorithm can perform polygon clipping and related operations of interest in VLSI CAD. The algorithm requires no preconditions from input polygons and