✦ LIBER ✦

Algorithm for Clpping Arbitrary Polygons

✍ Scribed by Rumen D. Andreev

Book ID: 115215636
Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 574 KB
Volume: 8
Category: Article
ISSN: 0167-7055
DOI: 10.1111/j.1467-8659.1989.tb00484.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Perceptually stable regions for arbitrar

Perceptually stable regions for arbitrary polygons

✍ Rocha, J. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 537 KB

An algorithm for recognizing palm polygo

An algorithm for recognizing palm polygons

✍ Subir Kumar Ghosh; Anil Maheshwari; Sudebkumar Prasant Pal; C. E. Veni Madhavan 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 878 KB

Systolic algorithms for rectilinear poly

Systolic algorithms for rectilinear polygons

✍ Rajiv Kane; Sartaj Sahni 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 744 KB

Fast algorithm for polygon decomposition

✍ Nahar, S.; Sahni, S. 📂 Article 📅 1988 🏛 IEEE 🌐 English ⚖ 880 KB

A universal trapezoidation algorithm for

A universal trapezoidation algorithm for planar polygons

✍ Borut Žalik; Gordon J Clapworthy 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 195 KB

An improved algorithm for intersecting c

An improved algorithm for intersecting convex polygons

✍ Youssef G. Saab 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 200 KB

A modification of a linear-time algorithm to compute the intersection of two convex polygons reduces the number of computational steps by almost half. @ 1997 Elsevier Science B.V.