Generalized Manhattan path algorithm with applications
Author:
- T. AsanoTAT. Asano
- 1 July 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 7 (7) , 797-804
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Optimal two-terminal α-β wire routingIntegration, 1988
- Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear ObstaclesIEEE Transactions on Computers, 1987
- Priority Search TreesSIAM Journal on Computing, 1985
- Computational Geometry—A SurveyIEEE Transactions on Computers, 1984
- An O(n log n) Manhattan path algorithmInformation Processing Letters, 1984
- A new point-location algorithm and its practical efficiency: comparison with existing algorithmsACM Transactions on Graphics, 1984
- An algorithm for resizing polygonal regions and its applications to LSI mask pattern designElectronics and Communications in Japan (Part I: Communications), 1984
- Finding a manhattan path and related problemsNetworks, 1983
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- Decomposable searching problemsInformation Processing Letters, 1979