Weak Visibility Queries of Line Segments in Simple Polygons

Given a simple polygon P in the plane, we present new algorithms and data structures for computing the weak visibility polygon from any query line segment in P. We build a data structure in O(n) time and O(n) space that can compute the visibility polygon for any query line segment s in O(k log n) time, where k is the size of the visibility polygon of s and n is the number of vertices of P. Alternatively, we build a data structure in O(n^3) time and O(n^3) space that can compute the visibility polygon for any query line segment in O(k + log n) time.Comment: 16 pages, 9 figures. A preliminary version of this paper appeared in ISAAC 2012 and we have improved results in this full versio

Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain

In this paper, we study the problem of moving $n$ sensors on a line to form a barrier coverage of a specified segment of the line such that the maximum moving distance of the sensors is minimized. Previously, it was an open question whether this problem on sensors with arbitrary sensing ranges is solvable in polynomial time. We settle this open question positively by giving an $O(n^2 \log n)$ time algorithm. For the special case when all sensors have the same-size sensing range, the previously best solution takes $O(n^2)$ time. We present an $O(n \log n)$ time algorithm for this case; further, if all sensors are initially located on the coverage segment, our algorithm takes $O(n)$ time. Also, we extend our techniques to the cycle version of the problem where the barrier coverage is for a simple cycle and the sensors are allowed to move only along the cycle. For sensors with the same-size sensing range, we solve the cycle version in $O(n)$ time, improving the previously best $O(n^2)$ time solution.Comment: This version corrected an error in the proof of Lemma 2 in the previous version and the version published in DCG 2013. Lemma 2 is for proving the correctness of an algorithm (see the footnote of Page 9 for why the previous proof is incorrect). Everything else of the paper does not change. All algorithms in the paper are exactly the same as before and their time complexities do not change eithe

Actively controlling the topological transition of dispersion based on electrically controllable metamaterials

Topological transition of the iso-frequency contour (IFC) from a closed ellipsoid to an open hyperboloid, will provide unique capabilities for controlling the propagation of light. However, the ability to actively tune these effects remains elusive and the related experimental observations are highly desirable. Here, tunable electric IFC in periodic structure which is composed of graphene/dielectric multilayers is investigated by tuning the chemical potential of graphene layer. Specially, we present the actively controlled transportation in two kinds of anisotropic zero-index media containing PEC/PMC impurities. At last, by adding variable capacitance diodes into two-dimensional transmission-line system, we present the experimental demonstration of the actively controlled magnetic topological transition of dispersion based on electrically controllable metamaterials. With the increase of voltage, we measure the different emission patterns from a point source inside the structure and observe the phase-transition process of IFCs. The realization of actively tuned topological transition will opens up a new avenue in the dynamical control of metamaterials.Comment: 21 pages,8 figure