Optimal algorithm for the rectilinear link center of a rectilinear polygon

被引：0

|

作者：

机构：

来源：

Comput Geom Theory Appl | / 3卷 / 169期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[31] RECTILINEAR M-CENTER PROBLEM
KO, MT
LEE, RCT
CHANG, JS
NAVAL RESEARCH LOGISTICS, 1990, 37 (03) : 419 - 427
[32] LINK LENGTH OF RECTILINEAR HAMILTONIAN TOURS IN GRIDS
KRANAKIS, E
KRIZANC, D
MEETENS, L
ARS COMBINATORIA, 1994, 38 : 177 - 192
[33] Rectilinear paths among rectilinear obstacles
Lee, DT
Yang, CD
Wong, CK
DISCRETE APPLIED MATHEMATICS, 1996, 70 (03) : 185 - 215
[34] RECTILINEAR PATHS AMONG RECTILINEAR OBSTACLES
LEE, DT
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 650 : 5 - 20
[35] Rectilinear paths among rectilinear obstacles
Discrete Appl Math, 3 (185):
[36] Genetic algorithm for the rectilinear steiner problem
Julstrom, Bryant A.
Australian Electronics Engineering, 1994, 27 (02):
[37] Realistic roofs without local minimum edges over a rectilinear polygon
Yoon, Sang Duk
Ahn, Hee-Kap
Sherette, Jessica
THEORETICAL COMPUTER SCIENCE, 2017, 675 : 15 - 26
[38] AN OPTIMAL PARALLEL ALGORITHM USING EXCLUSIVE READ WRITES FOR THE RECTILINEAR VORONOI DIAGRAM
GUHA, S
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1993, 3 (01): : 37 - 52
[39] ObSteiner: An Exact Algorithm for the Construction of Rectilinear Steiner Minimum Trees in the Presence of Complex Rectilinear Obstacles
Huang, Tao
Young, Evangeline F. Y.
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2013, 32 (06) : 882 - 893
[40] Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem
Kantor, Erez
Kutten, Shay
AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II, 2015, 9135 : 675 - 687

← 1 2 3 4 5 →