Practical Approaches to Partially Guarding a Polyhedral Terrain

نویسندگان

  • Frank Kammer
  • Maarten Löffler
  • Paul Mutser
  • Frank Staals
چکیده

We study the problem of placing guard towers on a terrain such that the terrain can be seen from at least one tower. This problem is important in many applications, and has an extensive history in the literature (known as, e.g., multiple observer siting). In this paper, we consider the problem on polyhedral terrains, and we allow the guards to see only a fixed fraction of the terrain, rather than everything. We experimentally evaluate how the number of required guards relates to the fraction of the terrain that can be covered. In addition, we introduce the concept of dominated guards, which can be used to preprocess the potential guard locations and speed up the subsequent computations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Guarding Polyhedral Terrains

We prove that [n/2J vertex guards are always sufficient and sometimes necessary to guard the surface of an n-vertex polyhedral terrain. We also show that l(4n 4)/13J edge guards are sometimes necessary to guard the surface of an n-vertex polyhedral terrain. The upper bound on the number of edge guards is ln/3J (Everett and Rivera-Campo, 1994). Since both upper bounds are based on the four color...

متن کامل

Visibility-based Distributed Deployment of Robotic Teams in Polyhedral Terrains

This paper presents deployment strategies for a team of multiple mobile robots with line-of-sight visibility in 1.5D and 2.5D terrain environments. Our objective is to distributively achieve full visibility of a polyhedral environment. In the 1.5D polyhedral terrain, we achieve this by determining a set of locations that the robots can distributively occupy. In the 2.5D polyhedral terrain, we a...

متن کامل

Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain

We present eecient polynomial time algorithms that place bn=2c vertex guards which cover the surface of an n-vertex polyhedral terrain, and similarly, bn=3c edge guards which cover the surface of an n-vertex polyhedral terrain. The time complexity of both algorithms, dominated by the cost of nding a maximum matching in a graph, is O(n 3=2).

متن کامل

Approximation algorithms for terrain guarding

We present approximation algorithms and heuristics for several variations of terrain guarding problems, where we need to guard a terrain in its entirety by a minimum number of guards. Terrain guarding has applications in telecommunications, namely in the setting up of antenna networks for wireless communication. Our approximation algorithms transform the terrain guarding instance into a MINIMUM...

متن کامل

Geometric Facility Location Optimization Thesis

This thesis is in Computational Geometry. Computational Geometry is a subfield of Computer Science that deals with problems of a geometric nature that arise in application domains such as Computer Graphics, Robotics, Geographic Information Systems (GIS), and Molecular Biology. More specifically, in this thesis we conduct research in Computational Geometry in the context of (Geometric) Facility ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014