Tight Span of Path Connected Subsets of the Manhattan Plane
Mehmet Kili\c{c}, \c{S}ahin Ko\c{c}ak

TL;DR
This paper presents a simple method to construct the tight span of path connected subsets in the Manhattan plane by using horizontal and vertical hatching followed by closure.
Contribution
It introduces a straightforward hatching technique to compute the tight span of path connected sets in the Manhattan plane, simplifying previous approaches.
Findings
Hatching in horizontal and vertical directions effectively constructs the tight span.
The method simplifies the process of finding tight spans in the Manhattan plane.
Closure of the hatching set yields the tight span.
Abstract
We show that the tight span of a path connected subset of the Manhattan plane can be constructed in a very simple way by "hatching" the subset in horizontal and vertical directions and then taking the closure of the resulting set.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Cellular Automata and Applications · Digital Image Processing Techniques
