Encompassing colored planar straight line graphs
نویسندگان
چکیده
منابع مشابه
Encompassing colored planar straight line graphs
Consider a planar straight line graph (PSLG), G, with k connected components, k 2. We show that if no component is a singleton, we can always find a vertex in one component that sees an entire edge in another component. This implies that when the vertices of G are colored, so that adjacent vertices have different colors, then (1) we can augment G with k−1 edges so that we get a color conforming...
متن کاملVertex-Colored Encompassing Graphs
It is shown that every disconnected vertex-colored plane straight line graph with no isolated vertices can be augmented (by adding edges) into a connected plane straight line graph such that the new edges respect the coloring and the degree of every vertex increases by at most two. The upper bound for the increase of vertex degrees is best possible: there are input graphs that require the addit...
متن کاملLinear Axis for Planar Straight Line Graphs
A linear axis is a straight line skeleton for a polygonal shape. The concept of a linear axis ε-equivalent to the medial axis has been introduced and studied for simple polygons and for those with holes. In this paper, we generalize the notions of a linear axis and of ε-equivalence to the case of planar straight line graphs. We show that for some graphs, a linear axis ε-equivalent to the medial...
متن کاملConstrained tri-connected planar straight line graphs∗
It is known that for any set V of n ≥ 4 points in the plane, not in convex position, there is a 3-connected planar straight line graph G = (V, E) with at most 2n− 2 edges, and this bound is the best possible. We show that the upper bound |E| ≤ 2n continues to hold if G is constrained to contain a given graph G0 = (V,E0), which is either a 1-factor (i.e., disjoint line segments) or a 2-factor (i...
متن کاملStraight Line Representations of Infinite Planar Graphs
graphs are denoted by capital roman letters and plane graphs by capital greek letters. If the graph G is isomorphic to the plane graph F, then F is a representation of G. If the edges of F are polygonal arcs (respectively straight line segments), then F is a polygonal arc representation (respectively straight line representation). A closed Jordan curve partitions the Euclidean plane into a boun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2008
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2007.05.006