Routing past unions of disjoint linear barriers

DOI10.1002/NET.3230130307zbMATH Open0522.94028OpenAlexW2068354545MaRDI QIDQ3674554FDOQ3674554

Orin Chein, Leon Steinberg

Publication date: 1983

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230130307

zbMATH Keywords

shortest pathbarriersminimal pathpolygonalalgorithms for reducing the size of the networkapproximate networkcomputer-aided design of printed circuit boards and integrated circuitsnetwork routing algorithm

Mathematics Subject Classification ID

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)

Cited In (2)

• Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
• Fastest path across constrained moving rectilinear obstacles

This page was built for publication: Routing past unions of disjoint linear barriers

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