Guarding polyhedral terrain by k-watchtowers

Tripathi, N and Pal, M and De, M and Das, G and Nandy, SC (2018) Guarding polyhedral terrain by k-watchtowers. In: 12th International Frontiers of Algorithmics Workshop, FAW 2018, 8 - 10 May 2018, Guangzhou, pp. 112-125.

PDF faw_2018.pdf - Published Version Restricted to Registered users only Download (476kB) | Request a copy

Abstract

The discrete k-watchtower problem for a polyhedral terrain (formula presented) with n vertices is to find k vertical segments, called watchtowers, of smallest common height, whose bottom end-points (bases) lie on some vertices of (formula presented), and every point of (formula presented) is visible from the top end-point of at least one of those vertical segments. Agarwal et al. 1 proposed a polynomial time algorithm using parametric search technique for this problem with k=2. Surprisingly, no result is known for the problem when k > 2. In this paper, we propose an easy to implement algorithm to solve k-watchtower problem in (formula presented) for a fixed constant k. Our algorithm does not use parametric search.

Item Type:	Conference Paper
Publication:	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher:	Springer Verlag
Additional Information:	The copyright for this article belongs to Springer Verlag.
Keywords:	Parameter estimation; Point contacts; Polynomial approximation; Towers; Visibility, Bottom ends; End points; Polyhedral terrains; Polynomial-time algorithms; Search technique; Watchtower problem, Problem solving
Department/Centre:	Division of Interdisciplinary Sciences > Computational and Data Sciences
Date Deposited:	01 Sep 2022 11:13
Last Modified:	01 Sep 2022 11:13
URI:	https://eprints.iisc.ac.in/id/eprint/76072

Actions (login required)

View Item