Approximating weighted shortest paths on polyhedral surfaces

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Approximating weighted shortest paths on polyhedral surfaces

Full text

Pdf (459 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the thirteenth annual symposium on Computational geometry table of contents

Nice, France

Pages: 485 - 486

Year of Publication: 1997

ISBN:0-89791-878-9

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

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 10, Downloads (12 Months): 26, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/262839.263101 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Pankaj K. Agarwal , Boris Aronov , Joseph O'Rourke , Catherine A. Schevon, Star Unfolding of a Polytope with Applications, SIAM Journal on Computing, v.26 n.6, p.1689-1713, Dec. 1997 [doi>10.1137/S0097539793253371]
	2	Jindong Chen , Yijie Han, Shortest paths on a polyhedron, Proceedings of the sixth annual symposium on Computational geometry, p.360-369, June 07-09, 1990, Berkley, California, United States [doi>10.1145/98524.98601]
	3	M. Lanthier, A. Maheshwari and J.-R. Sack, "Approximating Weighted Shortest Paths on Polyhedral Surfaces", Technical report, School of Computer Science, Carleton University, 1996.
	4	Mark Lanthier , Anil Maheshwari , Jörg-Rüdiger Sack, Approximating weighted shortest paths on polyhedral surfaces, Proceedings of the thirteenth annual symposium on Computational geometry, p.274-283, June 04-06, 1997, Nice, France [doi>10.1145/262839.262984]
	5	Joseph S. B. Mitchell , David M. Mount , Christos H. Papadimitriou, The discrete geodesic problem, SIAM Journal on Computing, v.16 n.4, p.647-668, Aug. 1987 [doi>10.1137/0216045]
	6	Joseph S. B. Mitchell , Christos H. Papadimitriou, The weighted region problem: finding shortest paths through a weighted planar subdivision, Journal of the ACM (JACM), v.38 n.1, p.18-73, Jan. 1991 [doi>10.1145/102782.102784]

CITED BY 3

	Christian S. Mata , Joseph S. B. Mitchell, A new algorithm for computing shortest paths in weighted planar subdivisions (extended abstract), Proceedings of the thirteenth annual symposium on Computational geometry, p.264-273, June 04-06, 1997, Nice, France
	Aaron W. F. Lee , David Dobkin , Wim Sweldens , Peter Schröder, Multiresolution mesh morphing, Proceedings of the 26th annual conference on Computer graphics and interactive techniques, p.343-350, July 1999
	Ovidiu Daescu , James D. Palmer, Finding optimal weighted bridges with applications, Proceedings of the 44th annual southeast regional conference, March 10-12, 2006, Melbourne, Florida