Skip to main content

Structuring Digital Plane by Closure Operators Associated with n-ary Relations

  • Conference paper
  • First Online:
Computational Modeling of Objects Presented in Images. Fundamentals, Methods, and Applications (CompIMAGE 2018)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 10986))

  • 252 Accesses

Abstract

We associate a closure operator with every n-ary relation (\(n>1\) an integer) on a given set. We focus on certain n-ary relations on the digital line \(\mathbb {Z}\) and study the closure operators on the digital plane \(\mathbb {Z}^2\) that are associated with special products of pairs of the relations. These closure operators, which include the Khalimsky topology, are shown to provide well behaved connectedness, so that they may be used as background structures on the digital plane for the study of digital images.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Čech, E.: Topological spaces. In: Topological Papers of Eduard Čech. Academia, Prague ch. 28, pp. 436–472 (1968)

    Google Scholar 

  2. Engelking, R.: General Topology. Państwowe Wydawnictwo Naukowe, Warszawa (1977)

    MATH  Google Scholar 

  3. Harrary, F.: Graph Theory. Addison-Wesley Publishing Company, Reading (1969)

    Book  Google Scholar 

  4. Khalimsky, E.D., Kopperman, R., Meyer, P.R.: Computer graphics and connected topologies on finite ordered sets. Topol. Appl. 36, 1–17 (1990)

    Article  MathSciNet  Google Scholar 

  5. Kong, T.Y.: Topological adjacency relations on \(Z^n\). Theor. Comput. Sci. 283, 3–28 (2002)

    Article  MathSciNet  Google Scholar 

  6. Rosenfeld, A.: Picture Languages. Academic Press, New York (1979)

    MATH  Google Scholar 

  7. Šlapal, J.: Jordan curve theorems with respect to certain pretopologies on \(\mathbb{Z}^2\). In: Brlek, S., Reutenauer, C., Provençal, X. (eds.) DGCI 2009. LNCS, vol. 5810, pp. 252–262. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04397-0_22

    Chapter  Google Scholar 

  8. Šlapal, J.: Convenient closure operators on \(\mathbb{Z}^2\). In: Wiederhold, P., Barneva, R.P. (eds.) IWCIA 2009. LNCS, vol. 5852, pp. 425–436. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-10210-3_33

    Chapter  Google Scholar 

  9. Šlapal, J.: Graphs with a path partition for structuring digital spaces. Inf. Sci. 233, 305–312 (2013)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

This work was supported by Brno University of Technology from the Specific Research project no. FSI-S-17-4464.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Josef Slapal .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Slapal, J. (2019). Structuring Digital Plane by Closure Operators Associated with n-ary Relations. In: Barneva, R., Brimkov, V., Kulczycki, P., Tavares, J. (eds) Computational Modeling of Objects Presented in Images. Fundamentals, Methods, and Applications. CompIMAGE 2018. Lecture Notes in Computer Science(), vol 10986. Springer, Cham. https://doi.org/10.1007/978-3-030-20805-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-20805-9_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-20804-2

  • Online ISBN: 978-3-030-20805-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics