APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS
From MaRDI portal
Publication:4650092
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)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
52C45: Combinatorial complexity of geometric structures
Related Items
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