THE DISCRETE GEODESIC PROBLEM

被引：426

作者：

MITCHELL, JSB

MOUNT, DM

PAPADIMITRIOU, CH

机构：

[1] UNIV MARYLAND,DEPT COMP SCI,BALTIMORE,MD 21201

[2] STANFORD UNIV,DEPT COMP SCI,STANFORD,CA 94305

[3] HUGHES ARTIFICIAL INTELLIGENCE CTR,STANFORD,CA 94305

来源：

关键词：

D O I：

10.1137/0216045

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

COMPUTER PROGRAMMING

引用

页码：647 / 668

页数：22

共 17 条

[1] Dijkstra E. W., 1959, NUMER MATH, P269, DOI DOI 10.1007/BF01386390
[2] TRIANGULATING A SIMPLE POLYGON
GAREY, MR
JOHNSON, DS
PREPARATA, FP
TARJAN, RE
[J]. INFORMATION PROCESSING LETTERS, 1978, 7 (04) : 175 - 179
[3] OPTIMAL SEARCH IN PLANAR SUBDIVISIONS
KIRKPATRICK, D
[J]. SIAM JOURNAL ON COMPUTING, 1983, 12 (01) : 28 - 35
[4] EUCLIDEAN SHORTEST PATHS IN THE PRESENCE OF RECTILINEAR BARRIERS
LEE, DT
PREPARATA, FP
[J]. NETWORKS, 1984, 14 (03) : 393 - 410
[5] LEE DT, 1978, ACT12 U ILL COORD SC
[6] ALGORITHM FOR PLANNING COLLISION-FREE PATHS AMONG POLYHEDRAL OBSTACLES
LOZANOPEREZ, T
WESLEY, MA
[J]. COMMUNICATIONS OF THE ACM, 1979, 22 (10) : 560 - 570
[7] LYUSTERNIK LA, 1964, SHORTEST PATHS VARIA
[8] MITCHELL JSB, 1986, ARTIFICIAL INTELLIGE, V1
[9] MITCHELL JSB, 1984, UNPUB SHORTEST PATHS
[10] Mount David M., 1985, 1495 U MAR DEP COMP