Routing past unions of disjoint linear barriers
From MaRDI portal
Publication:3674554
DOI10.1002/net.3230130307zbMath0522.94028OpenAlexW2068354545MaRDI 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 pathminimal pathbarrierspolygonalalgorithms for reducing the size of the networkapproximate networkcomputer-aided design of printed circuit boards and integrated circuitsnetwork routing algorithm
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15)
Related Items
Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon, Fastest path across constrained moving rectilinear obstacles