𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case

✍ Scribed by Pereira, José C.; Lobo, Fernando G.

Book ID
113082511
Publisher
Springer
Year
2012
Tongue
English
Weight
833 KB
Volume
27
Category
Article
ISSN
1000-9000

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An implementation of a divide and conque
An implementation of a divide and conquer algorithm for the unitary eigen problem
✍ Ammar, G. S.; Reichel, L.; Sorensen, D. C. 📂 Article 📅 1992 🏛 Association for Computing Machinery 🌐 English ⚖ 917 KB

We present a FORTRAN implementation of a divide-and-conquer method for computing the spectral resolution of a unitary upper Hessenberg matrix __H__ . Any such matrix __H__ of order __n__ , normalized so that its subdiagonal elements are nonnegative, can be written as a product of __n__ -1\* Givens m

The leaf sweep algorithm for an immobile
The leaf sweep algorithm for an immobile and moving target as an optimal control problem in radiotherapy delivery
✍ L. Papież 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 979 KB

variational problem of modelling the optimized dynamic delivery of intensity modulated radiation therapy is investigated. Motions of two jaws are determined that expose each point of the field for a predetermined amount of time and minimize the overall time of the radiation delivery. Variable initia