A Fast Algorithm for Approximating the Detour of a Polygonal Chain

Authors:
Annette Ebbers-Baumann;Rolf Klein;Elmar Langetepe;Andrzej Lingas
Affiliations:
-;-;-;-
Venue:
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Year:
2001

Citing 6
Cited 1

A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons

Computational Geometry: Theory and Applications
Classes of graphs which approximate the complete Euclidean graph

Discrete & Computational Geometry
Searching for the kernel of a polygon—a competitive strategy

Proceedings of the eleventh annual symposium on Computational geometry
Perspectives of Monge properties in optimization

Discrete Applied Mathematics
Generalized self-approaching curves

Discrete Applied Mathematics - Special issue 14th European workshop on computational geometry CG'98 Selected papers
Approximating the Stretch Factor of Euclidean Graphs

SIAM Journal on Computing

Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let C be a simple polygonal chain of n edges in the plane, and let p and q be two points on C. The detour of C on (p, q) is defined to be the length of the segment of C that connects p with q, divided by the Euclidean distance between p and q. Given an Ɛ 0, we compute in time O(n log n) a pair of points on which the chain makes a detour at least 1=(1 + Ɛ) times the maximum detour.