✦ LIBER ✦

An O(kN.log N) algorithm for decomposing a set of polygons into d-separable components

✍ Scribed by Sukhamay Kundu; Radhakrishnan Sridhar

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Ω(n log n) lower bound for decomposin

✍ Peter A. Bloniarz; S.S. Ravi 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 578 KB

An O(log n) time parallel algorithm for

✍ Cao An Wang; Yung H. Tsin 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 439 KB