A Note on a Result of Daurat and Nivat | SpringerLink
Skip to main content
Springer Nature Link
Log in

A Note on a Result of Daurat and Nivat

  • Conference paper
Developments in Language Theory (DLT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3572))

Included in the following conference series:

Abstract

We consider paths in the square lattice and use a valuation called the winding number in order to exhibit some combinatorial properties on these paths. As a corollary, we obtain a characteristic property of self-avoiding closed paths, generalizing in this way a recent result of Daurat and Nivat (2003) on the boundary properties of polyominoes concerning salient and reentrant points.

With the support of NSERC (Canada)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Braquelaire, J.-P., Vialard, A.: Euclidean Paths: A New Representation of Boundary of Discrete Regions. Graphical Models and Image Processing 61(1), 16–43 (1999)

    Article  MATH  Google Scholar 

  2. Brlek, S., Labelle, G., Lacasse, A.: Incremental algorithms based on discrete green theorem. In: Nyström, I., Sanniti di Baja, G., Svensson, S. (eds.) DGCI 2003. LNCS, vol. 2886, pp. 277–287. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Clarke, A.L.: Isometrical polyominoes. J. Recreational Math. 13, 18–25 (1980)

    MATH  MathSciNet  Google Scholar 

  4. Daurat, A., Nivat, M.: Salient and Reentrant Points of Discrete Sets. In: Proc. International Workshop on Combinatorial Image Analysis (IWCIA 2003), Palermo, Italy, May 14–16 (2003)

    Google Scholar 

  5. Freeman, H.: On the Encoding of Arbitrary Geometric Configurations. IRE Trans. Electronic Computer 10, 260–268 (1961)

    Article  MathSciNet  Google Scholar 

  6. Freeman, H.: Boundary encoding and processing. In: Lipkin, B.S., Rosenfeld, A. (eds.) Picture Processing and Psychopictorics, pp. 241–266. Academic Press, New York (1970)

    Google Scholar 

  7. Grunbaum, B., Shephard, G.C.: Tilings and Patterns. W. H. Freeman, New York (1987)

    Google Scholar 

  8. Grunbaum, B., Shephard, G.C.: Tilings and Patterns: An Introduction. W. H. Freeman, New York (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de Combinatoire et d’Informatique Mathématique, Université du Québec à Montréal, CP 8888, Succ. Centre-ville, Montréal, QC, Canada, H3C3P8

    Srečko Brlek, Gilbert Labelle & Annie Lacasse

Authors
  1. Srečko Brlek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gilbert Labelle
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Annie Lacasse
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica e Applicazioni, Università di Salerno, via Ponte Don Melillo, 84084, Fisciano, SA, Italy

    Clelia De Felice

  2. Dipartimento di Matematica ed Applicazioni, Università di Palermo, Via Archirafi, 34, 90123, Palermo, Italy

    Antonio Restivo

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brlek, S., Labelle, G., Lacasse, A. (2005). A Note on a Result of Daurat and Nivat. In: De Felice, C., Restivo, A. (eds) Developments in Language Theory. DLT 2005. Lecture Notes in Computer Science, vol 3572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11505877_17

Download citation

  • DOI: https://doi.org/10.1007/11505877_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26546-7

  • Online ISBN: 978-3-540-31682-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation