Visibility graphs of polygonal rings
نویسندگان
چکیده
منابع مشابه
Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles
We consider the problem of deciding whether or not a geometric graph has a crossing-free spanning tree. This problem is known to be NP-hard even for very restricted types of geometric graphs. In this paper, we present an O(n) time algorithm to solve this problem for the special case of geometric graphs that arise as visibility graphs of a finite set of n points between two monotone polygonal ob...
متن کاملUnsolved Problems in Visibility Graph Theory
The visibility graph is a fundamental structure studied in the field of computational geometry, and pose some special challenges [12, 26]. Apart from theoretical interests, visibility graphs has important applications also. Some of the early applications include computing Euclidean shortest paths in the presence of obstacles [36] and decomposing two-dimensional shapes into clusters [40]. For mo...
متن کاملOn zero-divisor graphs of quotient rings and complemented zero-divisor graphs
For an arbitrary ring $R$, the zero-divisor graph of $R$, denoted by $Gamma (R)$, is an undirected simple graph that its vertices are all nonzero zero-divisors of $R$ in which any two vertices $x$ and $y$ are adjacent if and only if either $xy=0$ or $yx=0$. It is well-known that for any commutative ring $R$, $Gamma (R) cong Gamma (T(R))$ where $T(R)$ is the (total) quotient ring of $R$. In this...
متن کاملA Note on the Combinatorial Structure of the Visibility Graph in Simple Polygons
Combinatorial structure of visibility is probably one of the most fascinating and interesting areas of engineering and computer science. The usefulness of visibility graphs in computational geometry and robotic navigation problems like motion planning, unknown-terrain learning, shortest-path planning, etc., cannot be overstressed. The visibility graph, apart from being an important data structu...
متن کاملGraphs with Plane Outside-Obstacle Representations
An obstacle representation of a graph consists of a set of polygonal obstacles and a distinct point for each vertex such that two points see each other if and only if the corresponding vertices are adjacent. Obstacle representations are a recent generalization of classical polygon–vertex visibility graphs, for which the characterization and recognition problems are long-standing open questions....
متن کامل