Search

Achievement of museum guide systems, in physical and virtual worlds, providing the personalization and context awareness features requires the prior analysis and identification of visitors΄ behaviors. This paper analyzes and synthesizes visitors΄ behaviors in museums and art galleries by using our defined parameters. A visit time and a observation distance can be calculated by using the proposed functions. The proposed synthesis algorithm is developed and used in classification. Classifying visitor styles is simply implemented by using the average and variance of their stopover time at and distance to all exhibits as shown in this paper. [ABSTRACT FROM AUTHOR]

This paper presents a new optimal algorithm for locating a set of sensors in 3D able to see the boundaries of a polyhedral environment. Our approach is iterative and is based on a lower bound on the sensors΄ number and on a restriction of the original problem requiring each face to be observed in its entirety by at least one sensor. The lower bound allows evaluating the quality of the solution obtained at each step, and halting the algorithm if the solution is satisfactory. The algorithm asymptotically converges to the optimal solution of the unrestricted problem if the faces are subdivided into smaller parts. [ABSTRACT FROM AUTHOR]

Art gallery problems have been extensively studied over the last decade and have found different type of applications. Normally the number of sides of a polygon or the general shape of the polygon is used as a measure of the complexity of the problem. In this paper we explore another measure of complexity, namely, the number of guards required to guard the boundary, or the walls, of the gallery. We prove that if n guards are necessary to guard the walls of an art gallery, then an additional team of at most 4n − 6 will guard the whole gallery. This result improves a previously known quadratic bound, and is a step towards a possibly optimal value of n − 2 additional guards. The proof is algorithmic, uses ideas from graph theory, and is mainly based on the definition of a new reduction operator which recursively eliminates the simple parts of the polygon. We also prove that every gallery with c convex vertices can be guarded by at most 2c − 4 guards, which is optimal. [ABSTRACT FROM AUTHOR]

We present heuristics for computing multiple watchman routes. Given a polygon (with or without holes) and a parameter k, we compute a set of k routes inside the polygon such that any point inside the polygon is visible from at least one point along one route. We measure the quality of our solutions by either the length of the longest route or the sum of the route lengths, where the goal is to minimize each. We start by computing a set of static guards [2], construct k routes that visit all the static guards and try to shorten the routes while maintaining full coverage of the polygon. We implemented the algorithm and present extensive results to evaluate our methods, including a comparison with lower bound routes based on the idea of visiting large number of visibility-independent ˵witness points″. Our experiments showed that for a large suite of input data our heuristics give efficient routes that are comparable with the optimal solutions. [ABSTRACT FROM AUTHOR]