2000 character limit reached
Geodesic diameter of a polygonal domain in O(n^4 log n) time (1006.1998v2)
Published 10 Jun 2010 in cs.CG and cs.DS
Abstract: We show that the geodesic diameter of a polygonal domain with n vertices can be computed in O(n4 log n) time by considering O(n3) candidate diameter endpoints; the endpoints are a subset of vertices of the overlay of shortest path maps from vertices of the domain.