On shortest paths amidst convex polyhedra

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: A Sharir Courant Institute of Mathematical Sciences, New York University and School of Mathematical Sciences, Tel Aviv University
A Baltsan Courant Institute of Mathematical Sciences, New York University and School of Mathematical Sciences, Tel Aviv University
Published in:
· Proceeding
SCG '86 Proceedings of the second annual symposium on Computational geometry
Pages 193-206
ACM New York, NY, USA ©1986
table of contents ISBN:0-89791-194-6 doi>10.1145/10515.10537
On shortest paths amidst convex polyhedra Published by ACM 1986 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 21
· Downloads (cumulative): 274
· 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