๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A data structure and algorithm based on a linear key for a rectangle retrieval problem

โœ Scribed by D.J. Abel; J.L. Smith


Publisher
Elsevier Science
Year
1983
Weight
567 KB
Volume
24
Category
Article
ISSN
0734-189X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A linear algorithm for point and line-ba
โœ Minas E. Spetsakis ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science โš– 982 KB

Two important structure from motion problems in recent years have been the point-based and the line-based problems (using image motion of points or lines to find 3D motion and structure). A considerable advance came from the development of separate linear algorithms for lines and points. However, t

A new algorithm for a class of linear no
โœ B.Y. Wu; X.Y. Li ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 203 KB

In this work, we present an algorithm for solving fourth-order multi-point boundary value problems (BVPs) based on the reproducing kernel method (RKM). In previous works, the RKM has been used to solve various two-point BVPs. However, it cannot be used directly to solve multi-point BVPs, since it is