An Algorithm For The Construction of The Tight Span of Finite Subsets of The Manhattan Plane

2016/03/04 by Mehmet Kılıç, Kılıç, Mehmet, Şahin Koçak +3
Mathematics · #FOS: Mathematics #Metric Geometry (math.MG) #math.MG

paper · pdf · doi:10.48550/arxiv.1603.01500

14 pages, 7 figures

arxiv created 2016/03/04 · arxiv updated 2016/03/07

Abstract

We give a simple algorithm for the construction of the tight span of a finite subset of the Manhattan plane.

Related

• Tight Span of Path Connected Subsets of the Manhattan Plane
• Trimming of Finite Subsets of the Manhattan Plane
• Optimally fast incremental Manhattan plane embedding and planar tight span construction
• An algorithm for computing cutpoints in finite metric spaces
• A fixed-parameter algorithm for the minimum Manhattan network problem