Abstract
The shortest path problem is fundamental to many areas of image processing, and we present ways to solve it in environments where computation space is scarce. We propose two constant-work-space algorithms for solving the shortest path problem for cactus graphs and clique-cactus graphs of arbitrary size; both algorithms perform in polynomial time. We also present an in-place algorithm for finding the shortest path in cactus graphs, which performs in polynomial time of lower degree.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asano, T.: Constant-working-space algorithms: How fast can we solve problems without using any extra array? In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, p. 1. Springer, Heidelberg (2008)
Asano, T.: Constant-working-space algorithm for image processing. In: Proc. of the First AAAC Annual meeting, Hong Kong, p. 3 (2008)
Asano, T.: Constant-working-space algorithms for image processing. In: Nielsen, F. (ed.) ETVC 2008. LNCS, vol. 5416, pp. 268–283. Springer, Heidelberg (2009)
Asano, T.: Constant-working-space image scan with a given angle. In: Proc. 24th European Workshop Comput. Geom (EWCG), Nancy, pp. 165–168 (2009)
Asano, T., Mulzer, W., Wang, Y.: Constant work-space algorithms for shortest paths in trees and simple polygons. J. of Graph Algorithms and Applications 15(5), 569–586 (2011)
Bose, P., Maheshwari, A., Morin, P., Morrison, J., Smid, M., Vahrenhold, J.: Space-efficient geometric divide and conquer algorithms. Comput. Geom. Theory Appl. 37(3), 209–227 (2007)
Bronnimann, H., Chan, T.M.: Space-Efficient algorithms for computing the convex hull of a simple polygonal line in linear time. Comput. Geom. 34(2), 75–82 (2006)
Chan, T.M., Chen, E.Y.: Towards in-place geometric algorithms and data structures. In: Proc. 20th Annual ACM Symposium on Computational Geometry, pp. 239–246 (2004)
Farhan, H.A., Owaied, H.H., Al-Ghazi Finding, S.I.: Shortest path for developed cognitive map using medial axis. World of Computer Science and Information Technology Journal 1(2), 17–25 (2011)
Hubler, A., Klette, R., Werner, G.: Shortest path algorithms for graphs of restricted in-degree and out-degree. Elektronische Informationsverarbeitung Kybernetik 18, 141–151 (1982)
Jakoby, A., Tantau, T.: Logspace algorithms for computing shortest and longest paths in series-parallel graphs. Technical Report TR03-077, ECCC Reports (2003)
Munro, J.I., Raman, V.: Selection from read-only memory and sorting with minimum data movement. Theoretical Computer Science 165(2), 311–323 (1996)
Muñuzuri, A.P., Chua, L.O.: Shortest-path-finder algorithm in a two-dimensional array of nonlinear electronic circuits. International Journal of Bifurcation and Chaos 8(12), 2493–2501 (1998)
Murata, Y., Mitani, Y.: A study of shortest path algorithms in maze images. In: Proc. SICE Annual Conference (SICE), pp. 32–33 (2011)
Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4), Art. #17, 24 pages (2008)
Sheng, Y.B., Wei, Y.K., Ping, L.J.: Research and application of image segmentation algorithm based on the shortest path in medical tongue processing. In: Proc. of the 2009 WRI World Congress on Software Engineering, vol. 1, pp. 239–243 (2009)
Yan, P., Kassim, A.A.: Medical image segmentation using minimal path deformable models with implicit shape priors. IEEE Transactions on Information Technology in Biomedicine 10(4), 677–684 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brimkov, B. (2013). Memory Efficient Shortest Path Algorithms for Cactus Graphs. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2013. Lecture Notes in Computer Science, vol 8033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41914-0_47
Download citation
DOI: https://doi.org/10.1007/978-3-642-41914-0_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41913-3
Online ISBN: 978-3-642-41914-0
eBook Packages: Computer ScienceComputer Science (R0)