✦ LIBER ✦

An optimal algorithm for finding an enclosing planar rectilinear annulus of minimum width

✍ Scribed by Olga N. Gluchshenko; Horst W. Hamacher; Arie Tamir

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 807 KB
Volume: 37
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2009.02.007

No coin nor oath required. For personal study only.

✦ Synopsis

Given a set P of n points in the plane, we consider the problem of finding a planar rectilinear annulus of minimum width which encloses the set P. We present an optimal O(n log n) algorithm for this problem.

📜 SIMILAR VOLUMES

An optimal algorithm for finding minimal

An optimal algorithm for finding minimal enclosing triangles

✍ Joseph O'Rourke; Alok Aggarwal; Sanjeev Maddila; Michael Baldwin 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 615 KB

An algorithm for finding the minimum ske

An algorithm for finding the minimum skeleton of a growing graph

✍ G.B. Roshchin 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 325 KB

An algorithm for finding optimal integra

An algorithm for finding optimal integration lattices of composite order

✍ J. N. Lyness; T. Sørevik 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 736 KB

An optimal algorithm for finding all the

An optimal algorithm for finding all the jumps of a monotone step-function

✍ Refael Hassin; Nimrod Megiddo 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 377 KB

An algorithm to find the number of paral

An algorithm to find the number of parallel stations for optimal cell scheduling

✍ Gursel A. Suer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 271 KB

An efficient and derivative-free algorit

An efficient and derivative-free algorithm for finding the minimum of a 1-D user-defined function

✍ F.X. Yu; V.P. Singh 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 634 KB

An efficient algorithm was developed for finding the minimum or maximum of a one-dimensional (I-D) user-defined function. The algorithm combined the quadratic interpolation, the Golden search, and an additional side search into a unified optimal search. Five I-D, four 2-D, and two 4-D functions were