Abstract
Let G be a plane geometric graph where each edge is a line segment. We consider the problem of computing the maximum detour of G , defined as the maximum over all pairs of distinct points (vertices as well as interior points of edges) p and q of G of the ratio between the distance between p and q in G and the Euclidean distance || pq || 2 . The fastest known algorithm for this problem has Θ ( n 2 ) running time where n is the number of vertices. We show how to obtain O ( n 3/2 (log n ) 3 ) expected running time. We also show that if G has bounded treewidth, its maximum detour can be computed in O ( n (log n ) 3 ) expected time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
