Jindong Chen and Yijie Han Department of Computer Science University of...  Home/Search
Context Related
| umkc.edu/~hanyij/research/poly.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umkc.edu/~hanyij/research...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a new scheme for storing shortest path information for a polyhedron. This scheme is obtained with a new observation on the properties of shortest path information of a polyhedron. Our scheme separates in a clear sense the problem of finding shortest paths and the problem of storing the shortest path information for retrieval. A tradeoff between time complexity O(d log n= log d) and space complexity O(n log n= log d) is obtained, where d is an adjustable parameter. When d tends to... (Update)
Similar documents based on text: More All
0.2: Efficient Parallel Algorithms for Computing All Pair Shortest .. - Han, Pan, Reif (1997) (Correct)
0.2: Concurrent Threads and Optimal Parallel Minimum Spanning.. - Chong, Han, Lam (2001) (Correct)
0.2: Matching Partition a Linked List and Its Optimization - Han (1989) (Correct)
BibTeX entry: (Update)
J. Chen and Y. Han. Storing shortest paths for a polyhedron. In F. Dehne, F. Fiala, and W. W. Koczkodaj, editors, Advances in Computing and Information - ICCI '91 International Conference Proceedings, pages 169--80. Springer-Verlag, 1991. 25 http://citeseer.ist.psu.edu/chen91storing.html More
@inproceedings{ chen91storing,
author = "J. Chen and Y. Han",
title = "Storing shortest paths for a polyhedron",
booktitle = "Advances in Computing and Information - {ICCI} '91 International Conference Proceedings",
publisher = "Springer-Verlag",
editor = "F. Dehne and F. Fiala and W. W. Koczkodaj",
pages = "169--80",
year = "1991",
url = "citeseer.ist.psu.edu/chen91storing.html" }
Citations (may not include all citations):61 The discrete geodesic problem (context) - Mitchell, Mount et al. - 1987
50 On shortest paths in polyhedral spaces (context) - Sharir, Schorr
21 Star unfolding of a polytope with applications - Agarwal, Aronov et al. - 1990
11 On finding shortest paths on convex polyhedra (context) - Mount - 1985
1 Applications of a planar separation theorem (context) - Tarjan - 1980
1 rd ACM Symposium on Computational Geometry (context) - Mount, subdivision et al. - 1986
1 ACM Symposium on Computational Geometry (context) - Chen, Han et al. - 1990
Documents on the same site (http://www.sice.umkc.edu/~hanyij/research/index.htm): More
Matching Partition a Linked List and Its Optimization - Han (1989) (Correct)
Time Lower Bounds for Sorting on Multi-Dimensional.. - Han, Igarashi (1990) (Correct)
An Optimal Linked List Prefix Algorithm on a Local Memory Computer - Han (1991) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC