An O (n5/2 log n) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions

被引：4

作者：

Wagner, David P. ^{[1
]}

Drysdale, Robert Scot ^{[2
]}

Stein, Clifford ^{[3
]}

机构：

[1] Korea Univ, Sch Elect Engn, Seoul, South Korea

[2] Dartmouth Coll, Dept Comp Sci, Hanover, NH 03755 USA

[3] Columbia Univ, Dept Ind Engn & Operat Res, New York, NY 10027 USA

来源：

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 2009年 / 42卷 / 05期

关键词：

Minimum link path; Rectilinear path; Shortest path; Binary space partition; Sweep plane; Segment tree; Priority queue; BINARY SPACE PARTITIONS; OBSTACLES; PATHS;

D O I：

10.1016/j.comgeo.2008.04.006

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper we consider the Rectilinear Minimum Link Path Problem among rectilinear obstacles in three dimensions. The problem is well studied in two dimensions, but is relatively unexplored in higher dimensions. We solve the problem in O(beta n log n) time, where n is the number of corners among all obstacles, and beta is the size of a binary space partition (BSP) decomposition of the space containing the obstacles. There exist methods to find a BSP where in the worst-case beta = Theta(n(3/2)), giving us an overall worst-case time of O (n(5/2) log n). Previously known algorithms have had worst-case running times of Omega(n(3)). (c) 2008 Elsevier B.V. All rights reserved.

引用

页码：376 / 387

页数：12

共 50 条

[41] A simplified algorithm for the all pairs shortest path problem with O(n2 log n) expected time
Takaoka, Tadao
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 25 (02) : 326 - 337
[42] An O(n2 log n) algorithm for the weighted stable set problem in claw-free graphs
Nobili, Paolo
Sassano, Antonio
MATHEMATICAL PROGRAMMING, 2021, 186 (1-2) : 409 - 437
[43] A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n2 log n) Expected Time
Takaoka, Tadao
Hashim, Mashitoh
COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT II, 2010, 6509 : 195 - 206
[44] AN O((N LOG P)2) ALGORITHM FOR THE CONTINUOUS P-CENTER PROBLEM ON A TREE
CHANDRASEKARAN, R
TAMIR, A
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (04): : 370 - 375
[45] An O(log*n) approximation algorithm for the asymmetric p-center problem
Panigrahy, R
Vishwanathan, S
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1998, 27 (02): : 259 - 268
[46] An O(log(*)n) approximation algorithm for the asymmetric p-center problem
Vishwanathan, S
PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1996, : 1 - 5
[47] An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem
Laboratory for Computer Science, Massachusetts Inst. of Technology, Cambridge, MA 02139, United States
不详
J Algorithms, 2 (259-268):
[48] An O(n log n) algorithm for the all-farthest-segments problem for a planar set of points
Drysdale, R. L. Scot
Mukhopadhyay, Asish
INFORMATION PROCESSING LETTERS, 2007, 105 (02) : 47 - 51
[49] An O(n log n)-time algorithm for the maximum constrained agreement subtree problem for binary trees
Peng, Z. S.
Ting, H. F.
INFORMATION PROCESSING LETTERS, 2006, 100 (04) : 137 - 144
[50] AN O(M LOG N)-TIME ALGORITHM FOR THE MAXIMAL PLANAR SUBGRAPH PROBLEM
CAI, JZ
HAN, XF
TARJAN, RE
SIAM JOURNAL ON COMPUTING, 1993, 22 (06) : 1142 - 1162

← 1 2 3 4 5 →