Rectilinear paths among rectilinear obstacles
Authors:
- D.T. LeeDLD.T. Lee
- C.D. YangCYC.D. Yang
- C.K. WongCWC.K. Wong
- 1 October 1996
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 70 (3) , 185-215
Abstract
No abstract availableKeywords
This publication has 45 references indexed in Scilit:
- SHORTEST PATH QUERIES IN RECTILINEAR WORLDSInternational Journal of Computational Geometry & Applications, 1992
- Triangulating a simple polygon in linear timeDiscrete & Computational Geometry, 1991
- On rectilinear link distanceComputational Geometry, 1991
- Rectilinear shortest paths in the presence of rectangular barriersDiscrete & Computational Geometry, 1989
- An algorithm for segment-dragging and its implementationAlgorithmica, 1988
- Generalized Manhattan path algorithm with applicationsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- Visibility of disjoint polygonsAlgorithmica, 1986
- On the Ordering of Connections for Automatic Wire RoutingIEEE Transactions on Computers, 1972
- A Modification of Lee's Path Connection AlgorithmIEEE Transactions on Electronic Computers, 1967
- A note on two problems in connexion with graphsNumerische Mathematik, 1959