To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area involves finding shortest paths in a tangent-visibility graph. However, construction of the full tangent-visibility graph is expensive, at least quadratic time in the number of nodes. In this paper we explore two idea...

A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially useful when depth information is not available, such as in the case of real-world photographs. Based on the optical flow information and the image intensity, the panorama is subdivided into variable-sized triangles, image...

A graph is called a strong ( resp. weak) bar 1-visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp. a subset of) the pairs of vertices whose bars have a -thick vertical line connecting them that intersects at most one other bar. We explore the relation among weak (resp. strong) bar 1-visibility graphs and other nearly pl...

Images can be generated for penetrable targets from their scattered fields when the time dependence of the incident electromagnetic (EM) wave takes the form of a ramp function. Previous researchers have developed these concepts for conducting targets. This paper focusses attention on penetrable targets. Ramp response signatures of the targets for cases where the dielectric constant of the targe...

The horizontal visibility algorithm was recently introduced as a mapping between time series and networks. The challenge lies in characterizing the structure of time series (and the processes that generated those series) using the powerful tools of graph theory. Recent works have shown that the visibility graphs inherit several degrees of correlations from their associated series, and therefore...

A bar 1-visibility drawing of a graph G is a drawing of G 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 en...

A graph is called a bar 1-visibility graph if its vertices can be represented as horizontal segments, called bars, and each edge corresponds to a vertical line of sight which can traverse another bar. If all bars are aligned at one side, then the graph is an aligned bar 1-visibility graph, AB1V graph for short. We consider AB1V graphs from different angles. First, we study combinatorial propert...

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...