A linear time algorithm for optimal routing around a rectangle

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Teofilo F. Gonzalez Univ. of California, Santa Barbara
Sing-Ling Lee Pennsylvania State Univ., University Park
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 35 Issue 4, Oct. 1988
Pages 810-831
ACM New York, NY, USA
table of contents doi>10.1145/48014.48018
A linear time algorithm for optimal routing around a rectangle Published by ACM 1988 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 8
· Downloads (cumulative): 334
· Citation Count: 5


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder