FINDING SHORTEST PATHS ON SURFACES USING LEVEL SETS PROPAGATION

被引：183

作者：

KIMMEL, R ^{[1
]}

AMIR, A ^{[1
]}

BRUCKSTEIN, AM ^{[1
]}

机构：

[1] TECHNION ISRAEL INST TECHNOL,DEPT COMP SCI,IL-32000 HAIFA,ISRAEL

来源：

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE | 1995年 / 17卷 / 06期

关键词：

CURVE EVOLUTION; EQUAL DISTANCE CONTOURS; GEODESIC PATH; NUMERICAL ALGORITHMS; MINIMAL GEODESICS;

D O I：

10.1109/34.387512

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We present a nerv algorithm for determining minimal length paths between two regions on a three dimensional surface, The numerical implementation is based on finding equal geodesic distance contours from a given area, These contours are calculated as zero sets of a bivariate function designed to evolve so as to track the equal distance curves on the given surface, The algorithm produces all paths of minimal length between the source and destination areas on the surface given as height values on a rectangular grid.

引用

页码：635 / 640

页数：6

共 17 条

[1]

CHOPP DL, 1992, UCLA9223 DEP MATH RE

[2]

Do Carmo M.P., 2016, DIFFERENTIAL GEOMETR

[3]

Epstein C L, 1987, WAVE MOTION THEORY M

[4] SHAPE OFFSETS VIA LEVEL SETS [J].

KIMMEL, R ;

BRUCKSTEIN, AM .

COMPUTER-AIDED DESIGN, 1993, 25 (03) :154-162

[5]

KIMMEL R, 1993, CIS9301 TECHN REP

[6]

KIMMEL R, 1994, IN PRESS J MATH IMAG

[7]

KIMMEL R, 1992, CIS9209 TECHN REP

[8]

KIMMEL R, 1995, INT J COMP MATH APP, V29, P49

[9] ESTIMATING SHORTEST PATHS AND MINIMAL DISTANCES ON DIGITIZED 3-DIMENSIONAL SURFACES [J].

KIRYATI, N ;

SZEKELY, G .

PATTERN RECOGNITION, 1993, 26 (11) :1623-1637

[10] PLANNING AND REASONING FOR AUTONOMOUS VEHICLE CONTROL [J].

MITCHELL, JSB ;

PAYTON, DW ;

KEIRSEY, DM .

INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 1987, 2 (02) :129-198

← 1 2 →