In this paper, we survey kinetic visibility problems. Unlike the research in traditional visibility problems, the researchers have also taken moving objects into consideration. These problems have been addressed from different practical aspects, such as computational graphics and robotic design. Over the years, some general combinatorial results of the visibility graph have been shown. Leveragi...

The work presented in this paper deals with the problem of the navigation of a mobile robot either in unknown indoor environment or in a partially known one. A navigation method in an unknown environment based on the combination of elementary behaviors has been developed. Most of these behaviors are achieved by means of fuzzy inference systems. The proposed navigator combines two types of obsta...

Visibility analysis or Viewshed is a common function of almost all GIS systems. The aim of this project is to find out the best solution, to compute viewshed for the Olomouc region and ensure the best way of visualisation of the results. The first step to analyze the visibility is making a high quality Digital Terrain Model, choice of the best interpolation method and subsequent addition of veg...

We study the influence of motion on the visibility of flicker distortions in naturalistic videos. A series of human subjective studies were executed to understand how motion silences the visibility of flicker distortions as a function of object motion, flicker frequency, and video quality. We found that flicker visibility is strongly reduced when the speed of coherent motion is large, and the e...

We present a novel GPU-based method for accelerating the visibility function computation of the lighting equation in dynamic scenes composed of rigid objects. The method pre-computes, for each object in the scene, the visibility and normal information, as seen from the environment, onto the bounding sphere surrounding the object and encodes it into maps. The visibility function is encoded by a ...

In this paper, we have investigated the dependence of the spectral entanglement and indistinguishability of photon pairs produced by the spontaneous parametric down-conversion (SPDC) procedure on the bandwidth of spectral filters used in the detection setup. The SPDC is a three-wave mixing process which occurs in a nonlinear crystal and generates entangled photon pairs and utilizes as one of th...

Let s denote a compact convex object in IR. The f-width of s is the perpendicular distance between two distinct parallel lines of support of s with direction f . A set of disjoint convex compact objects in IR is of equal f -width if there exists a direction f such that every pair of objects have equal f -width. A visibility matching, for a set of equal f -width objects is a matching using non-c...

It was shown recently that in the segment endpoint visibility graph Vis(S) of any set S of n disjoint line segments in the plane, there is an alternating path of length (log n), and this bound best possible apart from a constant factor. This talk focuses on the variant of the problem where S is a set of n disjoint axis-parallel line segments, and shows that the length of a longest alternating p...

In this paper we present a very simple proof of the following result due to Abello et al [5], concerning the visibility graphs of simple polygons. The result says that the visibility graph of any simple nondegenerate polygon is isomorphic to the visibility graph of some simple staircase polygon. As a result of the above proof we also give an O(n log n) time algorithm for the following problem: ...