An Algorithm For The Construction of The Tight Span of Finite Subsets of The Manhattan Plane
Mehmet K{\i}l{\i}\c{c}, \c{S}ahin Ko\c{c}ak, Yunus \"Ozdemir
TL;DR
This paper presents a straightforward algorithm for constructing the tight span of finite point sets within the Manhattan plane, facilitating analysis in metric geometry and related fields.
Contribution
It introduces a novel, simple algorithm specifically designed for the tight span construction in the Manhattan plane, improving computational efficiency.
Findings
Algorithm successfully constructs tight spans for finite sets
Method simplifies previous complex procedures
Potential applications in metric geometry and data analysis
Abstract
We give a simple algorithm for the construction of the tight span of a finite subset of the Manhattan plane.
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.