Abstract
This paper presents a new serial algorithm for selecting a nearly minimum number of vertex-guards so that all parts of a geographical surface modeled by a TIN (Triangulated Irregular Networks) is covered. Our algorithm selects fewer guards than the best existing algorithms on the average. Based on this approach, a new coarse-grain parallel algorithm for this problem is proposed. It has been showed that the upper bound for total number of guards, selected by this algorithm, is \(\lfloor \frac{2n}{3} \rfloor\) where n is number of vertices in the TIN. Average case analysis and implementation results show that in real TINs even fewer than \(\lfloor \frac{n}{2} \rfloor\) guards (proved upper bound of needed guards in worse-case) are selected by our serial and parallel algorithms.
This is a preview of subscription content, log in via an institution to check access.
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
Biedl, T., Bose, P., Demaine, E., Lubiw, A.: Efficient algorithms for Petersen’s Matching Theorem. In: Proc. of Symp. on Discrete Algorithms, pp. 130–139 (1999)
Bose, P., Kirkpatrick, D., Li, Z.: Worse-Case-Optimal Algorithms for Guarding Planar Graphs and Polyhedral Surfaces (1999)
Bose, P., Shermer, T., Toussaint, G., Zhu, B.: Guarding polyhedral terrains. Computational Geometry - Theory and Applications 7(3), 173–185 (1997)
Chiba, N., Nishizeki, T., Saito, N.: A linear five coloring algorithm for planar graphs. Journal of Algorithms (1981)
Chvátal, V.: A combinatorial theorem in plane geometry. Journal of Comb. Theory Ser. B 18, 39–41 (1975)
Cole, R., Sharir, M.: Visibility Problems for Polyhedral terrains. Journal of Symbolic Computation 7, 11–30 (1989)
de Floriani, L., Falcidieno, B., Pienovi, C., Allen, D., Nagy, G.: A visibility-based model for terrain features. In: Proc. 2nd International Symposium on Spatial Data Handling, pp. 235–250 (1986)
Fisk, S.: A short proof of chvátal’s watchman theorem. Journal of Comb. Theory Ser. B 24, 374 (1978)
Fjällstörm, P.O.: Algorithms for Graph Partitioning: A Survey, Linköping Electronic Articles in Computer and Information Science (1998)
Heath, M.T., Ranade, A., Schreiber, R.S.: Algorithms for parallel processing. Springer, Heidelberg (1998)
Karypis, G., Kumar, V.: METIS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices Version 4.0, University of Minnesota, September 20 (1998)
O’Rouke, j.: Art Gallery Theorems and Algorithms. Oxford University Press, Oxford (1987)
Pacheco, P.S.: Parallel Programming with MPI. Morgan Kaufmann, San Francisco (1997)
Parhami, B.: Introduction to Parallel Processing: Algorithms and Architectures. Springer, Heidelberg (1999)
Quinn, M.J.: Parallel Programming in C with MPI and OpenMP. McGraw-Hill Professional, New York (2004)
Shermer, T.: Recent results in art galleries. Proc. IEEE, Special Issue on Comp. Geom. (1992)
Urrutia, J.: Art Gallery and illumination Problems. In: Handbook on Comp. Geom., Elsevier, Amsterdam (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Taghinezhad Omran, M. (2008). Parallel Algorithm to Find Minimum Vertex Guard Set in a Triangulated Irregular Network. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2007. Lecture Notes in Computer Science, vol 4967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68111-3_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-68111-3_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68105-2
Online ISBN: 978-3-540-68111-3
eBook Packages: Computer ScienceComputer Science (R0)