𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear incremental algorithm for naive and standard digital lines and planes recognition

✍ Scribed by Lilian Buzer

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
435 KB
Volume
65
Category
Article
ISSN
1524-0703

No coin nor oath required. For personal study only.

✦ Synopsis

We present a new linear incremental method for digital hyperplanes recognition. The first linear incremental algorithm was given for 8-connected planar lines by Debled-Rennesson and Reveill e es [IJPRAI 9(6) (1995) 635]. Our method determines if any given set of points is a piece of a line in the plane (or a plane in space). We describe the transformation of the recognition problem into a linear programming (LP) problem relative to the naive and standard hyperplanes definitions. Then we present the LP Megiddo algorithm in linear time and explain its improvement toward a linear incremental method.

πŸ“œ SIMILAR VOLUMES

A fast and elementary algorithm for digi
A fast and elementary algorithm for digital plane recognition
✍ Y. GΓ©rard πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 126 KB

A digital naive plane is a subset of points (x, y, z) ∈ Z 3 verifying a double inequality h ≀ ax + by + cz < h + max{|a|, |b|, |c|} where (a, b, c) ∈ R/ {(0,0,0)} and h ∈ R. Given a finite subset of Z 3 , a problem is to determine whether or not there exists a digital naive plane containing it. This

A linear algorithm for point and line-ba
A linear algorithm for point and line-based structure from motion
✍ 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