✦ LIBER ✦

An approximation algorithm for cutting out convex polygons

✍ Scribed by Adrian Dumitrescu

Book ID: 108100914
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 172 KB
Volume: 29
Category: Article
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2004.01.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

An Optimal Illumination Region Algorithm

An Optimal Illumination Region Algorithm for Convex Polygons

✍ Lee, D.T.; Silio, C.B., Jr. 📂 Article 📅 1982 🏛 IEEE 🌐 English ⚖ 691 KB

An optimal algorithm for roundness deter

An optimal algorithm for roundness determination on convex polygons

✍ Kurt Swanson; D.T. Lee; Vanban L. Wu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 519 KB

An O(N) algorithm for polygonal approxim

An O(N) algorithm for polygonal approximation

✍ L.P Cordella; G Dettori 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 263 KB

An efficient algorithm for line clipping

An efficient algorithm for line clipping by convex polygon

✍ Václav Skala 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 284 KB

An efficient evolutionary algorithm for

An efficient evolutionary algorithm for accurate polygonal approximation

✍ Shinn-Ying Ho; Yeong-Chinq Chen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 276 KB