✦ LIBER ✦

An algorithm for dynamic subset and intersection testing

✍ Scribed by D.M. Yellin

Book ID: 107948813
Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 814 KB
Volume: 129
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90036-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for line intersection ident

An algorithm for line intersection identification

✍ Thomas J. Sebok; Louis E. Roemer; George S. Malindzak Jr. 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 385 KB

An optimal online algorithm for halfplan

An optimal online algorithm for halfplane intersection

✍ Jigang Wu; Yongchang Ji; Guoliang Chen 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 335 KB

An intersection algorithm for C2 paramet

An intersection algorithm for C2 parametric surfaces

✍ John J. Chen; Tulga M. Ozsoy 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 138 KB

A dynamic selection algorithm for global

A dynamic selection algorithm for globally optimal subsets

✍ Bin Yu; Baozong Yuan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 419 KB

Efficient dynamic algorithms for some ge

Efficient dynamic algorithms for some geometric intersection problems

✍ Siu Wing Cheng; Ravi Janardan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 705 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.