59,153 research outputs found
Oppositions in a line segment
Traditional oppositions are at least two-dimensional in the sense that they
are built based on a famous bidimensional object called square of oppositions
and on one of its extensions such as Blanch\'e's hexagon. Instead of
two-dimensional objects, this article proposes a construction to deal with
oppositions in a one-dimensional line segment.Comment: This is the version accepted for publication (South American Journal
of Logic, 2018
Recommended from our members
Minimum Cell Connection in Line Segment Arrangements
We study the complexity of the following cell connection problems in segment arrangements. Given a set of straight-line segments in the plane and two points a and b in different cells of the induced arrangement:
[(i)] compute the minimum number of segments one needs to remove so that there is a path connecting a to b that does not intersect any of the remaining segments; [(ii)] compute the minimum number of segments one needs to remove so that the arrangement induced by the remaining segments has a single cell.
We show that problems (i) and (ii) are NP-hard and discuss some special, tractable cases. Most notably, we provide a near-linear-time algorithm for a variant of problem (i) where the path connecting a
to b must stay inside a given polygon P with a constant number of holes, the segments are contained in P, and the endpoints of the segments are on the boundary of P. The approach for this latter result uses homotopy of paths to group the segments into clusters with the property that either all segments in a cluster or none participate in an optimal solution
Bar 1-Visibility Drawings of 1-Planar Graphs
A bar 1-visibility drawing of a graph is a drawing of where each
vertex is drawn as a horizontal line segment called a bar, each edge is drawn
as a vertical line segment where the vertical line segment representing an edge
must connect the horizontal line segments representing the end vertices and a
vertical line segment corresponding to an edge intersects at most one bar which
is not an end point of the edge. A graph is bar 1-visible if has a bar
1-visibility drawing. A graph is 1-planar if has a drawing in a
2-dimensional plane such that an edge crosses at most one other edge. In this
paper we give linear-time algorithms to find bar 1-visibility drawings of
diagonal grid graphs and maximal outer 1-planar graphs. We also show that
recursive quadrangle 1-planar graphs and pseudo double wheel 1-planar graphs
are bar 1-visible graphs.Comment: 15 pages, 9 figure
- …