Computing homotopic shortest paths in the plane

DOI10.1016/S0196-6774(03)00090-7MaRDI QIDQ4458869zbMATH OpenFDO

Authors Sergei Bespamyatnikh

Publication date 14 March 2004

Published in Journal of Algorithms (Search for Journal in Brave)

zbMATH Keywords

Shortest pathHomotopyOutput-sensitive algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 2079391
• Computing homotopic shortest paths efficiently
• scientific article; zbMATH DE number 1947410
• scientific article; zbMATH DE number 176745
• Shortest paths in arbitrary plane domains
• Finding Shortest Paths With Computational Geometry
• On Shortest Paths in Polyhedral Spaces
• Computing minimum length paths of a given homotopy class

Cited in

(23)

• Testing homotopy for paths in the plane
• Typical representatives of free homotopy classes in multi-punctured plane
• LATIN 2004: Theoretical Informatics
• Approximate shortest homotopic paths in weighted regions
• Computing minimum length paths of a given homotopy class
• Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges
• scientific article; zbMATH DE number 2079391 (Why is no real title available?)
• Computing homotopic shortest paths efficiently
• scientific article; zbMATH DE number 177559 (Why is no real title available?)
• A Census of Plane Graphs with Polyline Edges
• APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS
• Shortest path planning for a tethered robot
• Alternating paths along axis-parallel segments
• Computing homotopic line simplification
• scientific article; zbMATH DE number 2077086 (Why is no real title available?)
• Minimum weight connectivity augmentation for planar straight-line graphs
• scientific article; zbMATH DE number 1947410 (Why is no real title available?)
• Computing optimal homotopies over a spiked plane with polygonal boundary
• Testing homotopy for paths in the plane
• Homotopic \(\mathcal{C}\)-oriented routing
• Tightening nonsimple paths and cycles on surfaces
• Minimum weight connectivity augmentation for planar straight-line graphs
• Testing graph isotopy on surfaces

This page was built for publication: Computing homotopic shortest paths in the plane

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