Constraint shortest path computation on polyhedral surfaces

被引：0
|
作者：
Remi, Synave [1 ]
Stefka, Gueorguieva [1 ]
Pascal, Desbarats [1 ]
机构：
[1] Univ Bordeaux 1, LaBRI, UMR 5800, F-33405 Talence, France
来源：
SIXTH INDIAN CONFERENCE ON COMPUTER VISION, GRAPHICS & IMAGE PROCESSING ICVGIP 2008 | 2008年
关键词：
D O I：
10.1109/ICVGIP.2008.80
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
A new method to compute the shortest path over polyhedral surfaces is presented. Based on the consensus plane constrained subdivision of the initial surface, a discrete geodesic approximation is generated with respect to both metric and shape criterion optimization.
引用
收藏
页码：366 / 373
页数：8
相关论文
共 50 条
  • [41] Efficient Constraint Generation for Stochastic Shortest Path Problems
    Schmalz, Johannes
    Trevizan, Felipe
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 18, 2024, : 20247 - 20255
  • [42] A Shortest Path Algorithm under Specified Nodes Constraint
    Qian, Liu
    Yinfa, Zhang
    2018 INTERNATIONAL CONFERENCE ON SENSING, DIAGNOSTICS, PROGNOSTICS, AND CONTROL (SDPC), 2018, : 686 - 689
  • [43] Electric Vehicle Shortest Path Problem with Replenishment Constraint
    Baouche, Fouad
    Trigui, Rochdi
    Billot, Romain
    El Faouzi, Nour Eddin
    2014 INTERNATIONAL CONFERENCE ON CONNECTED VEHICLES AND EXPO (ICCVE), 2014, : 514 - 515
  • [44] Planar rectilinear shortest path computation using corridors
    Inkulu, Rajasekhar
    Kapoor, Sanjiv
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2009, 42 (09): : 873 - 884
  • [45] Towards Shortest Path Computation using Dijkstra Algorithm
    Makariye, Neha
    2017 IEEE INTERNATIONAL CONFERENCE ON IOT AND ITS APPLICATIONS (IEEE ICIOT), 2017,
  • [46] A faster computation of the most vital edge of a shortest path
    Nardelli, E
    Proietti, G
    Widmayer, P
    INFORMATION PROCESSING LETTERS, 2001, 79 (02) : 81 - 85
  • [47] COMPUTATION OF SHORTEST PATH IN GRAPHS AND APPROPRIATE DATA STRUCTURES
    BRAESS, D
    COMPUTING, 1971, 8 (1-2) : 171 - &
  • [48] Three-dimensional shortest path planning in the presence of polyhedral obstacles
    Jiang, K
    Seneviratne, LD
    Earles, SWE
    PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART C-JOURNAL OF MECHANICAL ENGINEERING SCIENCE, 1996, 210 (04) : 373 - 381
  • [49] New dynamic algorithms for shortest path tree computation
    Narváez, P
    Siu, KY
    Tzeng, HY
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2000, 8 (06) : 734 - 746
  • [50] Computation of Shortest Path in a Vague Network by Euclidean Distance
    Rashmanlou, Hossein
    Sahoo, Sankar
    Borzooei, R. A.
    Pal, Madhumangal
    Lakdashti, A.
    JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING, 2018, 30 (01) : 115 - 123
12345