Tight Span of Path Connected Subsets of the Manhattan Plane

2015/07/10 by Mehmet Kılıç, Mehmet Kiliç, Kiliç, Mehmet +2
Computer Science · Mathematics · #Cellular Automata and Applications #Computational Geometry and Mesh Generation #Digital Image Processing Techniques #FOS: Mathematics #Metric Geometry (math.MG) #math.MG

paper · pdf · doi:10.48550/arxiv.1507.05041

17 pages, 10 figures

arxiv created 2015/07/10 · openalex publication_date 2015/07/10 · arxiv updated 2015/07/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• An Algorithm For The Construction of The Tight Span of Finite Subsets of The Manhattan Plane
• Optimally fast incremental Manhattan plane embedding and planar tight span construction
• Trimming of Finite Subsets of the Manhattan Plane
• Packing Plane Spanning Trees into a Point Set
• Linear Size Planar Manhattan Network for Convex Point Sets