23 citations · 49 across the 9 of their papers we have counts for
9 papers
Reachability of turn sequences
William S. Evans, Noushin Saeedi, Chan-Su Shin +1
A turn sequence of left and right turns is realized as a simple rectilinear chain of integral segments whose turns at its bends are the same as the turn sequence. The chain starts…
Representing Graphs and Hypergraphs by Touching Polygons in 3D
William Evans, Paweł Rzążewski, Noushin Saeedi +2
Contact representations of graphs have a long history. Most research has focused on problems in 2D, but 3D contact representations have also been investigated, mostly concerning fu…
Minimum Rectilinear Polygons for Given Angle Sequences
William S. Evans, Krzysztof Fleszar, Philipp Kindermann +3
A rectilinear polygon is a polygon whose edges are axis-aligned. Walking counterclockwise on the boundary of such a polygon yields a sequence of left turns and right turns. The num…
Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons
Sang Won Bae, Chan-Su Shin, Antoine Vigneron
We establish tight bounds for beacon-based coverage problems, and improve the bounds for beacon-based routing problems in simple rectilinear polygons. Specifically, we show that $\…
Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme
Peter Brass, Hyeon-Suk Na, Chan-Su Shin
In this paper we study the identification of an event region within a larger region , in which the sensors are distributed by a Poisson process of density to detect this…
A Note on Minimum-Sum Coverage by Aligned Disks
Chan-Su Shin
In this paper, we consider a facility location problem to find a minimum-sum coverage of n points by disks centered at a fixed line. The cost of a disk with radius r has a form of…