In this paper, we study the weak point matching problem for a given set of n points and a class of equilateral triangles. The problem is to find the maximum car-dinality matching of the points using equilateral triangles such that each triangle contains exactly two points and each point lies at most in one triangle. Under the non-degeneracy assumption, we… (More)
In this paper, we consider the problem of placing a small number of angle guards inside a simple polygon P such that each point in the plane can determine if it is in or out of P from a monotone Boolean formula (and (.) and or (+) operations only) composed from the angle guards. Each angle guard views an infinite wedge of the plane. This class of new art… (More)
In this paper, we establish a lower bound on the number of inducing simple n-gons in grid-like arrangements of lines. We also show that the complexity associated with counting the number of inducing n-gons in an arrangement of collinear segments is #P-complete.