Characterizing and Detecting Toric Loops in n-Dimensional Discrete Toric Spaces

  • John Chaussard
  • Gilles Bertrand
  • Michel Couprie
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4992)

Abstract

Toric spaces being non-simply connected, it is possible to find in such spaces some loops which are not homotopic to a point: we call them toric loops. Some applications, such as the study of the relationship between the geometrical characteristics of a material and its physical properties, rely on three-dimensional discrete toric spaces and require detecting objects having a toric loop.

In this work, we study objects embedded in discrete toric spaces, and propose a new definition of loops and equivalence of loops. Moreover, we introduce a characteristic of loops that we call wrapping vector: relying on this notion, we propose a linear time algorithm which detects whether an object has a toric loop or not.

Keywords

Base Point Fundamental Group Homotopy Class Null Vector Linear Time Algorithm 
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. 1.
    Bear, J.: Dynamics of Fluids in Porous Media. Elsevier, Amsterdam (1972)Google Scholar
  2. 2.
    Hatcher, A.: Algebraic topology. Cambridge University Press, Cambridge (2002)MATHGoogle Scholar
  3. 3.
    Stillwell, J.: Classical Topology and Combinatorial Group Theory. Springer, Heidelberg (1980)MATHGoogle Scholar
  4. 4.
    Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley Longman Publishing Co., Inc, Boston, MA, USA (1994)MATHGoogle Scholar
  5. 5.
    Kong, T.Y.: A digital fundamental group. Computers & Graphics 13(2), 159–166 (1989)CrossRefGoogle Scholar
  6. 6.
    Chaussard, J., Bertrand, G., Couprie, M.: Characterization and detection of loops in n-dimensional discrete toric spaces. Technical Report IGM2008-02, Université de Marne-la-Vallée (2008)Google Scholar
  7. 7.
    Poincaré, H.: Analysis situs. Journal de l’Ecole Polytechnique, 2eme série, cahier 1, 1–121 (1895)Google Scholar
  8. 8.
    Malgouyres, R.: Computing the fundamental group in digital spaces. IJPRAI 15(7) (2001)Google Scholar
  9. 9.
    Bertrand, G., Couprie, M., Passat, N.: 3-D simple points and simple-equivalence (submitted, 2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • John Chaussard
    • 1
  • Gilles Bertrand
    • 1
  • Michel Couprie
    • 1
  1. 1.LABINFO-IGM, CNRS UMR8049 ESIEEUniversité Paris-EstNoisy le Grand CEDEXFrance

Personalised recommendations