Advertisement

A Question of Digital Linear Algebra

  • Yan Gérard
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1953)

Abstract

In classical linear algebra, the question to know if a vector v ∈ ℝn belongs to the linear space V ect{v1, v2, ⋯ , vk} generated by a familly of vectors, is solved by the Gauss pivot. The problem investigated in this paper is very close to this classical question: we denote \( \left\lfloor \cdot \right\rfloor _n \) the function of ℝn defined by \( \left\lfloor {\left( {x_i } \right)_{1 \leqslant i \leqslant n} } \right\rfloor _n = \left( {\left\lfloor {x_i } \right\rfloor } \right)_{1 \leqslant i \leqslant n} \) and the question is now to determine if a given vector v ∈ ℤn belongs to \( \left\lfloor {Vect\left\{ {v^1 ,v^2 , \cdots ,v^k } \right\}} \right\rfloor _n \). This problem can be easily seen as a sytem of inequalities and solved by using linear programming but in some special cases, it can also be seen as a particular geometrical problem and solved by using tools of convex geometry. We will see in this framework that the question v ∈ \( \left\lfloor {Vect\left\{ {v^1 ,v^2 , \cdots ,v^k } \right\}} \right\rfloor _n \)? generalizes the problem of recognition of the finite parts of digital hyperplanes and we will give equivalent formulations which allow to solve it efficiently.

Keywords

Convex Hull Linear Form Polynomial Approximation Simplex Method Linear Inequality 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. DR94.
    I. Debled-Renesson & J. P. Reveillès, An incremental algorithm for digital plane recognition. 4th DGCI, Grenoble, France, 1994. 128, 131Google Scholar
  2. D95.
    I. Debled-Renesson, Étude et reconnaissance des droites et plans discrets. Thèse de doctorat soutenue à l’Université Louis Pasteur de Strasbourg, 1995.128Google Scholar
  3. D86.
    A. Douady, Algorithms for computing angles in the Mandelbrot set. Chaotic dynamics and fractals (Atlanta, GA., 1985) pp155–168, Notes Rep. Math.Sci. Engrg., 2, Academic Press, Orlanda, FL, 1986. auE87._H. Edelsbrunner, Algorithms in Combinatorial Geometry. EATCS, Monographs on Theoritical Computer Science, Springer-Verlag, 1987. 127, 133, 134Google Scholar
  4. FST96.
    J. Françon, J. M. Schramm & M. Tajine, Recognizing arithmetic straightlines and planes. 6th Conference on Discrete Geometry in Computer Imagery, Lyon, 1996. 128, 131Google Scholar
  5. GA60.
    D. Gale, The Theory of Linear Economic Models. McGraw-Hill, 1960.Google Scholar
  6. GE99.
    Y. Gerard, Contribution à la géométrie discrète, thèse de doctorat soutenue e l’Université d’Auvergne, 1999.Google Scholar
  7. R91.
    J. P. Reveillès, Géométrie discrète, calcul en nombre entiers et algorithmique. Thèse de doctorat soutenue à l’Universitée Louis Pasteur de Strasbourg, 1991. 130Google Scholar
  8. R95.
    J. P. Reveillès, Combinatorial pieces in digital lines and planes. Vision Geometry IV, vol 2573 SPIE 1995. 128Google Scholar
  9. S88.
    C. L. Siegel, Lectures on the Geometry of Numbers. Springer-Verlag, 1988. 127Google Scholar
  10. V64.
    F. Valentine, Convex sets. McGraw-Hill, series in Higher Mathematics, 1964. 132Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Yan Gérard
    • 1
  1. 1.Laboratoire de Logique et d’Informatique de Clermont1 (LLAIC1) IUTDépartement d’Informatique, Ensemble Universitaire des CézeauxAubière CedexFrance

Personalised recommendations