Computing homotopic shortest paths efficiently

DOI10.1007/3-540-45749-6_38MaRDI QIDQ4411377zbMATH OpenFDO

Authors Stephen G. Kobourov, Anna Lubiw, Alon Efrat

Publication date 8 July 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/2461/24610411.htm

Mathematics Subject Classification ID

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

Recommendations

• Computing homotopic shortest paths efficiently
• Computing homotopic shortest paths in the plane
• scientific article; zbMATH DE number 2079391
• Testing homotopy for paths in the plane
• Shortest paths in the plane with polygonal obstacles

Cited in

(15)

• Computing minimum length paths of a given homotopy class
• Testing homotopy for paths in the plane
• Schematization of networks
• Computing homotopic shortest paths efficiently
• Efficient Computation of the Outer Hull of a Discrete Path
• Homotopic Rectilinear Routing with Few Links and Thick Edges
• Computing the lengths of shortest paths in Z^ n
• Computing shortest transversals
• Computing minimum length paths of a given homotopy class. (Extended abstract)
• scientific article; zbMATH DE number 1262422 (Why is no real title available?)
• Computing homotopic shortest paths in the plane
• scientific article; zbMATH DE number 2079391 (Why is no real title available?)
• Testing homotopy for paths in the plane
• APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS
• LATIN 2004: Theoretical Informatics

This page was built for publication: Computing homotopic shortest paths efficiently

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