An Efficient Algorithm for the Least Areas Path Problem

被引：0

作者：

Fan, Gaojun ^{[1
]}

Jin, Shiyao ^{[1
]}

机构：

[1] Natl Univ Def Technol, Natl Lab Parallel & Distributed Proc, Changsha 410073, Hunan, Peoples R China

来源：

2008 ISECS INTERNATIONAL COLLOQUIUM ON COMPUTING, COMMUNICATION, CONTROL, AND MANAGEMENT, VOL 1, PROCEEDINGS | 2008年

关键词：

D O I：

10.1109/CCCM.2008.202

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The goal of the least areas path problem (LAPP) is to find a path traversing through a given region covered by a set of areas with any arbitrary shape, between a given pair of points and with the property that each point on the path is covered by the least areas. Different the weighted region optimal path problem, the LAPP asks for the cost of each step in path is as low as possible. Based on the relationship between boundaries of sub-regions and the least areas path, we can transform this continuous-domain problem to a discrete one by calculating the coverage of curves of sub-regions' boundaries. Depending on binary-search and breadth-first-search, an efficient and fast algorithm was devised for solving the LAPP..

引用

页码：369 / 373

页数：5

共 50 条

[31] SPLZ: An efficient algorithm for single source shortest path problem using compression method
Sun, Jingwei
Sun, Guangzhong
GEOINFORMATICA, 2016, 20 (01) : 1 - 18
[32] An efficient fault-containing self-stabilizing algorithm for the shortest path problem
Huang, Tetz C.
DISTRIBUTED COMPUTING, 2006, 19 (02) : 149 - 161
[33] Algorithm for Automatic Path Routing in Mountain Areas
Adamek, Katarzyna
Lupa, Michal
Sarlej, Wojciech
WORLD MULTIDISCIPLINARY EARTH SCIENCES SYMPOSIUM (WMESS 2018), 2019, 221
[34] An efficient parallel implementation of a least squares problem
Ruano, AEB
Fleming, PJ
Jones, DI
COMPUTING SYSTEMS IN ENGINEERING, 1995, 6 (4-5): : 313 - 318
[35] An efficient approach to the linear least squares problem
Tunyan, K
Egiazarian, K
Tuniev, A
Astola, J
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2004, 26 (02) : 583 - 598
[36] Efficient algorithms for the longest path problem
Uehara, R
Uno, Y
ALGORITHMS AND COMPUTATION, 2004, 3341 : 871 - 883
[37] A PARALLEL ALGORITHM FOR THE MAXIMAL PATH PROBLEM
ANDERSON, R
COMBINATORICA, 1987, 7 (04) : 315 - 326
[38] AN EFFICIENT ALGORITHM FOR THE CLASSICAL LEAST SQUARES APPROXIMATION
Dimitrov, Dimitar K.
Peixoto, Lourenco L.
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2020, 42 (05): : A3233 - A3249
[39] AN EFFICIENT ALGORITHM FOR MINING CAUSALITY LEAST PATTERN
Abdullah, Zailani
Deris, Mustafa Mat
Jaafar, S. Zulaikha
PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON ADVANCED COMPUTER THEORY AND ENGINEERING (ICACTE 2009), VOLS 1 AND 2, 2009, : 1103 - 1110
[40] Efficient algorithm for untestable path detection
Heo, H
Hwang, SY
ELECTRONICS LETTERS, 1996, 32 (08) : 707 - 708

← 1 2 3 4 5 →