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

A recursive procedure for finding the intersection of two digital curves

โœ Scribed by J.J Little; T.K Peucker

Publisher
Elsevier Science
Year
1979
Weight
713 KB
Volume
10
Category
Article
ISSN
0146-664X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Double-Digit Lehmer-Euclid Algorithm f
A Double-Digit Lehmer-Euclid Algorithm for Finding the GCD of Long Integers
โœ Tudor Jebelean ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 316 KB

The use of pairs of double digits in the Lehmer-Euclid multiprecision GCD algorithm halves the number of long multiplications, but a straightforward implementation of this idea does not give the desired speed-up. We show how to overcome the practical difficulties by using an enhanced condition for e

A procedure for determining the centrome
A procedure for determining the centromere in the classification of wheat metaphases by digital computer
โœ Mario Aiello; Antonio Albano; Giorgio Levi ๐Ÿ“‚ Article ๐Ÿ“… 1970 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 249 KB

In this paper an iterative algorithm is described to determine an axial line for rodlike chromosomes with one bend. The density profile used for determining the centromere will be constructed relative to this axial line. The possibility is also mentioned of using the second-order moment (referred t