On bends and distances of paths among obstacles in two-layer interconnection model

DOI10.1109/12.286304zbMath1042.68682OpenAlexW2107735380MaRDI QIDQ4420049

No author found.

Publication date: 1994

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.286304

zbMATH Keywords

rectilinear shortest paths

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Finding shortest path in the presence of barriers: an alternate approach ⋮ Minimum-link paths revisited ⋮ An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model ⋮ An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions ⋮ Rectilinear paths among rectilinear obstacles

This page was built for publication: On bends and distances of paths among obstacles in two-layer interconnection model