9 citations · 16 across the 4 of their papers we have counts for
5 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…
On problems related to crossing families
William Evans, Noushin Saeedi
Given a set of points in the plane, a \emph{crossing family} is a collection of segments, each joining two of the points, such that every two segments intersect internally. Aronov…
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…
Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs
Radoslav Fulek, Noushin Saeedi, Deniz Sarioz
The disjoint convex obstacle number of a graph G is the smallest number h such that there is a set of h pairwise disjoint convex polygons (obstacles) and a set of n points in the p…