✦ LIBER ✦

Space searching for intersecting objects

✍ Scribed by David P Dobkin; Herbert Edelsbrunner

Book ID: 103628201
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 782 KB
Volume: 8
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(87)90015-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Focused color intersection with efficien

Focused color intersection with efficient searching for object extraction

✍ V.V Vinod; Hiroshi Murase 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 898 KB

Nonempty Intersection Theorems and Gener

Nonempty Intersection Theorems and Generalized Multi-objective Games in ProductFC-Spaces

✍ Xie Ping Ding 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 159 KB

Grid intersect quantization schemes for

Grid intersect quantization schemes for solid object digitization

✍ P.V. Sankar 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 642 KB

Two simple grid intersect quantization schemes h~r digitizing solid objects are described. These algorithms map the closed boundary curve of I;he solid objecb into a regular sequence of fern'-connected domains ~ ml lhe digital plane. The digitization sequence .'D is associated wi01 ~ pseudodigital c

The intersection searching problem for c

The intersection searching problem for c-oriented polygons

✍ Xue-Hou Tan; Tomio Hirata; Yasuyoshi Inagaki 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 615 KB

Geometry of Dynamical Search for Objects

✍ L. G. Chkhartishvili; E. V. Shikin 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 208 KB

Optimal binary space partitions for orth

Optimal binary space partitions for orthogonal objects

✍ Michael S Paterson; F Frances Yao 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 813 KB