We present a new and simpler method to implement in constant amortized time the ip operation of the so-called 'Greedy Flip Algorithm', an optimal algorithm to compute the visibility graph/complex of a collection of pairwise disjoint bounded convex sets of constant complexity. The method uses only the incidence structure of the visibility complex and only the primitive predicate which states tha...

The problem of searching for a mobile robber in a simple polygon by a number of searchlights is considered. A searchlight is a stationary point which emits a single ray that cannot penetrate the boundary of the polygon. The direction of the ray can be changed continuously, and a point is detected by a searchlight at a given time if and only if it is on the ray. A robber is a point that can move...

The social responsibility of a tourism destination results from the combined efforts of the single stakeholders. This needs coordination and harmonization that cannot be achieved without a deep understanding of the structural and dynamic characteristics of the destination.. A tourism destination is a complex dynamic system and requires specific methods to be analyzed and understood in order to ...

We show that the visibility graph of a set of non-intersecting translates of the same compact convex object in R always contains a Hamiltonian path. Furthermore, we show that every other edge in the Hamiltonian path can be used to obtain a perfect matching that is realized by a set of non-intersecting lines of sight. ? 2001 Elsevier Science B.V. All rights reserved.

Cycle simulators, in-circuit emulators, and hardware accelerators have made it possible to rapidly model the functionality of large digital designs. But these techniques provide limited visibility of internal design nodes, making debugging hard. Simulators run slowly when all nodes are traced. Emulators provide full visibility only with limited depth, or with greatly reduced speed. This paper d...

We show that the visibility graph of a set of disjoint congruent discs in IR is Hamiltonian, as long as the discs are not all supported by the same line. The proof is constructive, and leads to efficient algorithms for obtaining a Hamilton circuit.

We examine how the Fusion method handles the followings aspects which characterize a better documentation of the inter-object behavior, namely styles of specification, readability, formal basis, composition and refinement, completeness, temporal ordering of operations, structural constraints, global invariants, individual object specification, preand postconditions, and finally, use case descri...

We study versions of cop and robber pursuit-evasion games on the visibility graphs of polygons, and inside polygons with straight and curved sides. Each player has full information about the other player’s location, players take turns, and the robber is captured when the cop arrives at the same point as the robber. In visibility graphs we show the cop can always win because visibility graphs ar...

We consider the problem of finding a minimalistic configuration of sensors that enable a simple robot inside an initially unknown polygon P on n vertices to reconstruct the visibility graph of P . The robot can sense features of its environment through its sensors, and it is allowed to move from vertex to vertex. We aim at understanding which sensorial capabilities are sufficient for the recons...

Time series can be transformed into graphs called horizontal visibility graphs (HVGs) in order to gain useful insights. Here, the maximum eigenvalue of the adjacency matrix associated to the HVG derived from several time series is calculated. The maximum eigenvalue methodology is able to discriminate between chaos and randomness and is suitable for short time series, hence for experimental resu...