APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS

DOI10.1142/S0218195912600059zbMath1251.68284MaRDI QIDQ4650092

Jiongxin Jin, Yajun Wang, Antoine Vigneron, Siu-Wing Cheng

Publication date: 23 November 2012

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

shortest pathweighted regionhomotopic path

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

Related Items (1)

Typical representatives of free homotopy classes in multi-punctured plane

Cites Work

• On local routing of two-terminal nets
• Computing minimum length paths of a given homotopy class
• Testing homotopy for paths in the plane
• Computing homotopic shortest paths efficiently
• Determining approximate shortest paths on weighted polyhedral surfaces
• Approximate Shortest Paths in Anisotropic Regions
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• The weighted region problem
• Computing homotopic shortest paths in the plane
• On finding approximate optimal paths in weighted regions

This page was built for publication: APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS