Routing in polygons without rectilinearly visible corners

DOI10.1006/INCO.1993.1008zbMath0786.68043OpenAlexW1992080000MaRDI QIDQ1207958

Michael Kaufmann, Gerhard Klär

Publication date: 16 May 1993

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1993.1008

zbMATH Keywords

routingplanar grid graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

This page was built for publication: Routing in polygons without rectilinearly visible corners