Determination of gradient and curvature constrained optimal paths

被引:60
作者
de Smith, MJ [1 ]
机构
[1] UCL, Ctr Adv Spatial Anal, London, England
关键词
D O I
10.1111/j.1467-8667.2005.00414.x
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This article provides an analysis of gradient and curvature constraints on path form and length, with particular reference to road, rail, and pipeline route selection. Initially, we examine the case of a single (global) gradient constraint and a planar surface, with or without boundaries and obstacles. This leads to a consideration of surface representation using rectangular lattices and procedures for determining shortest gradient-constrained paths across such surfaces. Gradient-constrained distance transforms are introduced as a new procedure to enable such optimal paths to be computed, and examples are provided for a range of landform profiles and gradients. Horizontal and vertical curvature constraints are then analyzed and incorporated into final solution paths at subsequent stages of the optimization process. Such paths may then be used as preanalyzed input to detailed cost and engineering models to speed up, and where possible improve, the quality and cost-effectiveness of route selection.
引用
收藏
页码:24 / 38
页数:15
相关论文
共 15 条
[1]   DISTANCE TRANSFORMATIONS IN DIGITAL IMAGES [J].
BORGEFORS, G .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1986, 34 (03) :344-371
[2]   LINEAR-TIME EUCLIDEAN DISTANCE TRANSFORM ALGORITHMS [J].
BREU, H ;
GIL, J ;
KIRKPATRICK, D ;
WERMAN, M .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1995, 17 (05) :529-533
[3]   Distance transforms as a new tool in spatial analysis, urban planning, and GIS [J].
de Smith, MJ .
ENVIRONMENT AND PLANNING B-PLANNING & DESIGN, 2004, 31 (01) :85-104
[4]  
DEBOOR C, 2003, SPLINE TOOLBOX USER
[5]  
*DEP TRANSP, 1993, 993 TD, V6
[6]  
Ehlschlaeger C., 1996, P INT S SPAT DAT HAN
[7]   EVALUATION OF LATTICE SOLUTIONS TO PROBLEM OF CORRIDOR LOCATION [J].
GOODCHILD, MF .
ENVIRONMENT AND PLANNING A, 1977, 9 (07) :727-738
[8]   Solving the shortest route cut and fill problem using simulated annealing [J].
Henderson, D ;
Vaughan, DE ;
Jacobson, SH ;
Wakefield, RR ;
Sewell, EC .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 145 (01) :72-84
[9]   Preliminary highway design with genetic algorithms and geographic information systems [J].
Jong, JC ;
Jha, MK ;
Schonfeld, P .
COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, 2000, 15 (04) :261-271
[10]   Parallel computation of the Euclidean distance transform on a three-dimensional image array [J].
Lee, YH ;
Horng, SJ ;
Seitzer, J .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2003, 14 (03) :203-212