Approximating weighted shortest paths on polyhedral surfaces

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Mark Lanthier School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, Canada K1S 5B6
Anil Maheshwari School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, Canada K1S 5B6
Jörg-Rüdiger Sack School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, Canada K1S 5B6
Published in:
Cover Image
 
· Proceeding
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Pages 274-283
ACM New York, NY, USA ©1997
table of contents ISBN:0-89791-878-9 doi>10.1145/262839.262984
Approximating weighted shortest paths on polyhedral surfaces Published by ACM 1997 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 25
· Downloads (cumulative): 509
· Citation Count: 28


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