Paths through a maze of rectangles

DOI10.1002/NET.3230220404MaRDI QIDQ4018994zbMATH OpenOpenAlexFDO

Authors E. N. Gilbert, E. G. jun. Coffman

Publication date 16 January 1993

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

heuristic algorithmsmazes of rectanglesroboticsshort pathsVLSI wire-routing

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10)

Recommendations

• An algorithm for finding shortest paths in a maze
• Time-efficient maze routing algorithms on reconfigurable mesh architectures
• SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
• Rectilinear paths among rectilinear obstacles
• Rectilinear Path Problems among Rectilinear Obstacles Revisited

Cited in

(7)

• Orientation in a maze
• Time-efficient maze routing algorithms on reconfigurable mesh architectures
• Rectilinear paths among rectilinear obstacles
• Rook Jumping Maze Design Considerations
• Search in a Maze
• An algorithm for finding shortest paths in a maze
• scientific article; zbMATH DE number 7700603 (Why is no real title available?)

This page was built for publication: Paths through a maze of rectangles

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