Routing past unions of disjoint linear barriers
From MaRDI portal
Publication:3674554
DOI10.1002/net.3230130307zbMath0522.94028MaRDI QIDQ3674554
Publication date: 1983
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230130307
shortest path; minimal path; barriers; polygonal; algorithms for reducing the size of the network; approximate network; computer-aided design of printed circuit boards and integrated circuits; network routing algorithm
90C35: Programming involving graphs or networks
05C35: Extremal problems in graph theory
05C38: Paths and cycles
94C15: Applications of graph theory to circuits and networks
Related Items
Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon, Fastest path across constrained moving rectilinear obstacles