Parallel algorithm to find minimum vertex guard set in a triangulated irregular network

Authors:
Masoud Taghinezhad Omran
Affiliations:
Sharif University of Technology
Venue:
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Year:
2007

Citing 8
Cited 0

Art gallery theorems and algorithms

Art gallery theorems and algorithms
Visibility problems for polyhedral terrains

Journal of Symbolic Computation
Parallel programming with MPI

Parallel programming with MPI
Guarding polyhedral terrains

Computational Geometry: Theory and Applications
Efficient algorithms for Petersen's matching theorem

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Introduction to Parallel Processing: Algorithms and Architectures

Introduction to Parallel Processing: Algorithms and Architectures
Algorithms for Parallel Processing

Algorithms for Parallel Processing
Parallel Programming in C with MPI and OpenMP

Parallel Programming in C with MPI and OpenMP

Quantified Score

Hi-index	0.00

Visualization

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 ⌊2n/3⌋ where n is number of vertices in the TIN. Average case analysis and implementation results show that in real TINs even fewer than ⌊n/2⌋ guards (proved upper bound of needed guards in worse-case) are selected by our serial and parallel algorithms.