Reducing the memory required to find a geodesic shortest path on a large mesh

GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems

Volumn , Issue , 2009, Pages 227-235

  Verma, Vishal ^a   Snoeyink, Jack ^a  

^a University of North Carolina   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION TIME; CONTINUOUS DIJKSTRA; DIJKSTRA; FAST-MARCHING; MEMORY REQUIREMENTS; ORDERS OF MAGNITUDE; SHORTEST PATH; TERRAIN MODEL;

DATA STRUCTURES; INFORMATION SYSTEMS; TITANIUM COMPOUNDS; ULSI CIRCUITS; WIRELESS SENSOR NETWORKS;

GEOGRAPHIC INFORMATION SYSTEMS;

EID: 74049153308     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1653771.1653804     Document Type: Conference Paper

References (26)

1. A. Aggarwal and J. S. Vitter. The Input/Output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, 1988.
2. L. Arge, O. Procopiuc, and J. S. Vitter. Implementing I/O-Efficient data structures using TPIE. In Proc. European Symposium on Algorithms, pages 88-100. Springer, 2002.
3. L. Arge and L. Toma. External data structures for shortest path queries on planar digraphs. In Proc 16th Int'l Symp on Algorithms and Computation, volume 3827 of LNCS, pages 328-338, 2005.
4. L. Arge, L. Toma, and J. S. Vitter. I/O-efficient algorithms for problems on grid-based terrains. In In Proc. Workshop on Algorithm Engineering and Experimentation, 2000.
5. E. P. F. Chan and N. Zhang. Finding shortest paths in large network systems. In GIS '01: Proceedings of the 9th ACM international symposium on Advances in geographic information systems, pages 160-166, New York, NY, USA, 2001. ACM.
6. J. Chen and Y. Han. Shortest paths on a polyhedron. In SCG '90: Proceedings of the sixth annual symposium on Computational geometry, pages 360-369, New York, NY, USA, 1990. ACM.
7. R. A. Chowdhury and V. Ramachandran. External-memory exact and approximate all-pairs shortest-paths in undirected graphs. In SODA, pages 735-744, 2005.
8. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
9. A. V. Goldberg, H. Kaplan, and R. Werneck. Reach for A*: Efficient point-to-point shortest path algorithms. In Proc 8th Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM, 2006.
10. A. V. Goldberg and R. Werneck. Computing point-to-point shortest paths from external memory. In Proceedings Workshop on Algorithm Engineering and Experiments (ALENEX 2005). SIAM, 2005.
11. P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths in graphs. IEEE Trans. Syst. Sci. and Cybernetics, SSC-4(2):100-107, 1968.
12. T. Hazel, L. Toma, J. Vahrenhold, and R. Wickremesinghe. Terracost: Computing least-cost-path surfaces for massive grid terrains. J. Exp. Algorithmics, 12:1-31, 2008.
13. M. R. Henzinger, P. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. In Journal of Computer and System Sciences, pages 27-37, 1994.
14. M. Isenburg and P. Lindstrom. Streaming meshes. In IEEE Visualization Conference, 2005.
15. M. Isenburg, Y. Liu, J. Shewchuk, and J. Snoeyink. Streaming computation of Delaunay triangulations. ACM Trans. Graph., 25(3):1049-1056, 2006. (Proc. SIGGRAPH'06).
16. M. Isenburg, Y. Liu, J. Shewchuk, J. Snoeyink, and T. Thirion. Generating raster DEM from mass points via TIN streaming. In Proc. GIScience, number 4197 in LNCS, pages 186-198. Springer Verlag, 2006.
17. M. Isenburg, Y. Liu, and J. Snoeyink. Pipelined streaming: Extraction of elevation contours from LIDAR points. Workshop on Massive Data Algorithmics, June 2009.
18. R. Kimmel and J. Sethian. Computing geodesic paths on manifolds. Proc. of National Academy of Sci., 95(15):8431-8435, 1998.
19. M. Lanthier, A. Maheshwari, and J.-R. Sack. Approximating shortest paths on weighted polyhedral surfaces. Algorithmica, 30(4):527-562, 2001.
20. U. Meyer and V. Osipov. Design and implementation of a practical I/O-efficient shortest paths algorithm. In I. Finocchi and J. Hershberger, editors, ALENEX, pages 85-96. SIAM, 2009.
21. J. Mitchell, D. Mount, and C. Papadimitriou. The discrete geodesic problem. SIAM Journal of Computing, 16(4):647-668, 1987.
22. J. S. B. Mitchell. Geometric shortest paths and network optimization. In Handbook of Computational Geometry, pages 633-701. Elsevier Science Publishers B.V. North-Holland, 2000.
23. P. Mooney and A. C. Winstanley. An evolutionary algorithm for multicriteria path optimization problems. International Journal of Geographical Information Science, 20(4):401-423, 2006.
24. W. G. Rees. Least-cost paths in mountainous terrain. Computers and Geosciences, 30(3):203-209, 2004.
25. V. Surazhsky, T. Surazhsky, D. Kirsanov, S. J. Gortler, and H. Hoppe. Fast exact and approximate geodesics on meshes. ACM Transactions on Graphics, 24(3):553-560, 2005.
26. S. Winter. Weighting the path continuation in route planning. In GIS '01: Proceedings of the 9th ACM international symposium on Advances in geographic information systems, pages 173-176, New York, NY, USA, 2001. ACM.