On rectilinear link distance
- 31 July 1991
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 1 (1) , 13-34
- https://doi.org/10.1016/0925-7721(91)90010-c
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Triangulating a simple polygon in linear timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On some link distance problems in a simple polygonIEEE Transactions on Robotics and Automation, 1990
- Rectilinear shortest paths in the presence of rectangular barriersDiscrete & Computational Geometry, 1989
- Computing the link center of a simple polygonDiscrete & Computational Geometry, 1988
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- A theorem on polygon cutting with applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Finding minimum rectilinear distance paths in the presence of barriersNetworks, 1981