Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model

DOI10.1142/S0218195997000363MaRDI QIDQ4375872zbMATH OpenOpenAlexFDO

Authors

Publication date 8 February 1998

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195997000363

zbMATH Keywords

shortest pathtwo-layer modelVLSI routing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On bends and distances of paths among obstacles in two-layer interconnection model
• An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model
• ON BENDS AND LENGTHS OF RECTILINEAR PATHS: A GRAPH-THEORETIC APPROACH
• scientific article; zbMATH DE number 177558

Cited in

(8)

• Rectilinear paths among rectilinear obstacles
• Performing Multicut on Walkable Environments
• Resolving interferences of triple‐crossover‐cranes by determining paths in networks
• scientific article; zbMATH DE number 177558 (Why is no real title available?)
• On bends and distances of paths among obstacles in two-layer interconnection model
• An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model
• Finding a shortest pair of paths on the plane with obstacles and crossing areas
• Finding shortest path in the presence of barriers: an alternate approach

This page was built for publication: Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375872)