Geodesic diameter of a polygonal domain in O(n^4 log n) time
Computational Geometry
2011-06-01 v2 Data Structures and Algorithms
Abstract
We show that the geodesic diameter of a polygonal domain with n vertices can be computed in O(n^4 log n) time by considering O(n^3) candidate diameter endpoints; the endpoints are a subset of vertices of the overlay of shortest path maps from vertices of the domain.
Cite
@article{arxiv.1006.1998,
title = {Geodesic diameter of a polygonal domain in O(n^4 log n) time},
author = {Mikko Koivisto and Valentin Polishchuk},
journal= {arXiv preprint arXiv:1006.1998},
year = {2011}
}
Comments
NOTE: It has turned out that, unfortunately, Lemma 2 does not hold, which renders the main result incorrect