We consider the problem of triangle guarding (4-guarding) a simple, 2D polygon Q. A polygon Q is 4-guarded if every point q of Q is contained in the convex hull of some three guards that can all see q. This rather odd condition approximates a desire, for example, to see all sides of q or to locate (via triangulation) q from at least two angularly well-separated views. If we restrict the guards ...

Locating a minimum number of guards on terrain such that every point the is guarded by at least one known as Terrain Guarding Problem (TGP). In this paper, realistic example guarding problem studied, involving surveillance rugged geographical means thermal cameras. A issues related to TGP are addressed with integer-programming models proposed solve problem. Also, sensitivity analysis carried ou...

Across many taxa, guarding of fertile mates is a widespread tactic that enhances paternity assurance. However, guarding of mates can also occur during the nonfertile period, and the fitness benefits of this behavior are unclear. Male songbirds, for example, sometimes guard nonfertile females during foraging recesses from incubation. We hypothesized that guarding postreproductive mates may have ...

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...

Higher brain functions are sculpted on the basis of the mainly “hard-wired” primary emotions through the process of Affective Neural Darwinism. Here we make a tentative new proposal as to the nature of the primary emotional systems, based largely on a combination of the work of Panksepp on affective neuroscience, the work of Stevens, Price and others on evolutionary psychiatry, and data on anim...

In the 1.5-dimensional terrain guarding problem we are given as input an x-monotone chain (the terrain) and asked for the minimum set of guards (points on the terrain) such that every point on the terrain is seen by at least one guard. It has recently been shown that the 1.5-dimensional terrain guarding problem is approximable to within a constant factor [3,7], though no attempt has been made t...