Determining approximate shortest paths on weighted polyhedral surfaces

doi:10.1145/1044731.1044733

Determining approximate shortest paths on weighted polyhedral surfaces

Full Text:

PDF

Buy this Article

Authors:	L. Aleksandrov	Bulgarian Academy of Sciences, Sofia, Bulgaria
	A. Maheshwari	Carleton University, Ottawa, Ontario, Canada
	J.-R. Sack	Carleton University, Ottawa, Ontario, Canada

Published in:

· Journal

Journal of the ACM (JACM) JACM Homepage archive

Volume 52 Issue 1, January 2005
Pages 25-53
ACM New York, NY, USA
table of contents doi>10.1145/1044731.1044733

	2005 Article
Bibliometrics
· Downloads (6 Weeks): 2 · Downloads (12 Months): 68 · Downloads (cumulative): 1,356 · Citation Count: 25

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms approximation algorithms computational geometry design design and analysis of algorithms geometrical problems and computations performance polyhedral surfaces shortest path problems weighted paths

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

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