Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions
暂无分享,去创建一个
[1] Jörg-Rüdiger Sack,et al. Determining approximate shortest paths on weighted polyhedral surfaces , 2005, JACM.
[2] Joseph S. B. Mitchell,et al. k-Link Shortest Paths in Weighted Subdivisions , 2005, WADS.
[3] Joseph S. B. Mitchell,et al. The weighted region problem: finding shortest paths through a weighted planar subdivision , 1991, JACM.
[4] Ovidiu Daescu. Improved Optimal Weighted Links Algorithms , 2002, International Conference on Computational Science.
[5] Xiaodong Wu,et al. Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions , 1999, SCG '99.