Optimal algorithm for the rectilinear link center of a rectilinear polygon

被引：0

作者：

机构：

来源：

Comput Geom Theory Appl | / 3卷 / 169期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[21] Location of rectilinear center trajectories
J. M. Díaz-Báñez
J. A. Mesa
Top, 1998, 6 (2) : 159 - 177
[22] MINIMUM DISSECTION OF A RECTILINEAR POLYGON WITH ARBITRARY HOLES INTO RECTANGLES
SOLTAN, V
GORPINEVICH, A
DISCRETE & COMPUTATIONAL GEOMETRY, 1993, 9 (01) : 57 - 79
[23] Complexities of efficient solutions of rectilinear polygon cover problems
P. Berman
B. DasGupta
Algorithmica, 1997, 17 : 331 - 356
[24] Complexities of efficient solutions of rectilinear polygon cover problems
Berman, P
DasGupta, B
ALGORITHMICA, 1997, 17 (04) : 331 - 356
[25] Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems
Dept. of Comp. Sci. and Engineering, Pennsylvania State University, University Park, PA 16802, United States
不详
Algorithmica (New York), 4 (331-356):
[26] The Steiner tree problem for terminals on the boundary of a rectilinear polygon
Cheng, SW
THEORETICAL COMPUTER SCIENCE, 2000, 237 (1-2) : 213 - 238
[27] An efficient algorithm to decompose a compound rectilinear shape into simple rectilinear shapes
Sharif, Imran
Chaudhuri, Debasis
Kushwaha, Naveen
Samal, Ashok
Singh, Brij Mohan
TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES, 2018, 26 (01) : 150 - 161
[28] A PROBABLY FAST, PROVABLY OPTIMAL ALGORITHM FOR RECTILINEAR STEINER TREES
DENEEN, LL
SHUTE, GM
THOMBORSON, CD
RANDOM STRUCTURES & ALGORITHMS, 1994, 5 (04) : 535 - 557
[29] OPTIMAL BSPs AND RECTILINEAR CARTOGRAMS
De Berg, Mark
Mumford, Elena
Speckmann, Bettina
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2010, 20 (02) : 203 - 222
[30] An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
Wang, DP
INFORMATION PROCESSING LETTERS, 2001, 79 (05) : 229 - 236

← 1 2 3 4 5 →