Convenient Closure Operators on $\mathbb Z^2$

DOI10.1007/978-3-642-10210-3_33zbMath1267.68257OpenAlexW1969208433MaRDI QIDQ3651633

Josef Šlapal

Publication date: 11 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10210-3_33

zbMATH Keywords

closure operatordigital planeJordan curveAlexandroff pretopologyconnectedness graph

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (9)

Unnamed Item ⋮ Terse walk sets in graphs and induced closure operators ⋮ A Jordan Curve Theorem in the Digital Plane ⋮ Galois connections between sets of paths and closure operators in simple graphs ⋮ Convenient adjacencies for structuring the digital plane ⋮ Categorical aspects of inducing closure operators on graphs by sets of walks ⋮ A digitization method of subspaces of the Euclidean \(n\)D space associated with the Khalimsky adjacency structure ⋮ Alexandroff pretopologies for structuring the digital plane ⋮ A Jordan curve theorem with respect to a pretopology on ℤ²

This page was built for publication: Convenient Closure Operators on $\mathbb Z^2$