Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Shortest paths and networks
JSB Mitchell - Handbook of discrete and computational …, 2017 - api.taylorfrancis.com
Handbook of DISCRETE AND COMPUTATIONAL GEOMETRY Page 1 i “K25063” — 2017/9/15
— 18:58 — page 811 — i i i 31 SHORTEST PATHS AND NETWORKS Joseph SB Mitchell …
— 18:58 — page 811 — i i i 31 SHORTEST PATHS AND NETWORKS Joseph SB Mitchell …
Approximate shortest descending paths
SW Cheng, J ** - SIAM Journal on Computing, 2014 - SIAM
We present an approximation algorithm for the shortest descending path problem. Given a
source s and a destination t on a terrain, a shortest descending path from s to t is a path of …
source s and a destination t on a terrain, a shortest descending path from s to t is a path of …
Triangulation refinement and approximate shortest paths in weighted regions
Let be a planar subdivision with n vertices. Each face of has a weight from [1, ρ]∪{∞}. A
path inside a face has cost equal to the product of its length and the face weight. In general …
path inside a face has cost equal to the product of its length and the face weight. In general …
Shortest paths on polyhedral surfaces and terrains
SW Cheng, J ** - Proceedings of the forty-sixth annual ACM symposium …, 2014 - dl.acm.org
We present an algorithm for computing shortest paths on polyhedral surfaces under convex
distance functions. Let n be the total number of vertices, edges and faces of the surface. Our …
distance functions. Let n be the total number of vertices, edges and faces of the surface. Our …
[HTML][HTML] Approximation algorithms for shortest descending paths in terrains
A path from s to t on a polyhedral terrain is descending if the height of a point p never
increases while we move p along the path from s to t. No efficient algorithm is known to find …
increases while we move p along the path from s to t. No efficient algorithm is known to find …
Shortest descending paths: Towards an exact algorithm
M Ahmed, A Lubiw - International Journal of Computational …, 2011 - World Scientific
A path from s to t on a polyhedral terrain is descending if the height of a point p never
increases while we move p along the path from s to t. Although a shortest path on a terrain …
increases while we move p along the path from s to t. Although a shortest path on a terrain …
Shortest gently descending paths
A path from s to t on a polyhedral terrain is descending if the height of a point p never
increases while we move p along the path from s to t. We introduce a generalization of the …
increases while we move p along the path from s to t. We introduce a generalization of the …
[HTML][HTML] Optimal facility location problem on polyhedral terrains using descending paths
We study the descending facility location (DFL) problem on the surface of a triangulated
terrain. A path from a point s to a point t on the surface of a terrain is descending if the …
terrain. A path from a point s to a point t on the surface of a terrain is descending if the …
[PDF][PDF] Properties of shortest descending paths
M Ahmed, A Lubiw - The 17th Fall Workshop on Computational and …, 2007 - Citeseer
A path from s to t on a polyhedral terrain is descending if the height of a point p never
increases while we move p along the path from s to t. No efficient algorithm is known to find …
increases while we move p along the path from s to t. No efficient algorithm is known to find …
Constrained shortest paths in terrains and graphs
M Ahmed - 2009 - uwspace.uwaterloo.ca
Finding a shortest path is one of the most well-studied optimization problems. In this thesis
we focus on shortest paths in geometric and graph theoretic settings subject to different …
we focus on shortest paths in geometric and graph theoretic settings subject to different …