A fast algorithm for approximating the detour of a polygonal chain

DOI10.1007/3-540-44676-1_27MaRDI QIDQ4796185zbMATH OpenFDO

Authors Annette Ebbers-Baumann, Rolf Klein, Elmar Langetepe, Andrzej Lingas

Publication date 2 March 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2161/21610321

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A fast algorithm for approximating the detour of a polygonal chain.
• A natural metric for curves -- computing the distance for polygonal chains and approximation algorithms
• Efficient algorithms for approximating polygonal chains
• Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
• Computing the Maximum Detour of a Plane Graph in Subquadratic Time

Cited in

(4)

• A fast algorithm for approximating the detour of a polygonal chain.
• scientific article; zbMATH DE number 842885 (Why is no real title available?)
• On the stretch factor of polygonal chains
• On the stretch factor of polygonal chains

This page was built for publication: A fast algorithm for approximating the detour of a polygonal chain

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4796185)