Plane integral drawings of planar graphs
نویسندگان
چکیده
منابع مشابه
Plane integral drawings of planar graphs
A plane integral drawing of a planar graph G is a realization of G in the plane such that the vertices of G are mapped into distinct points and the edges of G are mapped into straight line segments of integer length which connect the corresponding vertices such that two edges have no inner point in common. We conjecture that plane integral drawings exist for all planar graphs, and we give parts...
متن کاملDrawings of Planar Graphs
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an injective embedding π of the ver-tex set of G into the plane. Let fix (G, π) be the maximum integer k such that there exists a crossing-free redrawing π ′ of G which keeps k vertices k. We give examples of planar graph...
متن کاملRook-drawings of Plane Graphs
We introduce a new type of graph drawing called “rook-drawing”. A rook-drawing of a graph G is obtained by placing the n nodes of G on the intersections of a regular grid, such that each row and column of the grid supports exactly one node. This paper focuses on rook-drawings of planar graphs. We first give a linear algorithm to compute a planar straight-line rook-drawing for outerplanar graphs...
متن کاملPointed drawings of planar graphs☆
We study the problem how to draw a planar graph crossing-free such that every vertex is incident to an angle greater than π. In general a plane straight-line drawing cannot guarantee this property. We present algorithms which construct such drawings with either tangent-continuous biarcs or quadratic Bézier curves (parabolic arcs), even if the positions of the vertices are predefined by a given ...
متن کاملObfuscated Drawings of Planar Graphs
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an injective embedding π of the vertex set of G into the plane. Let fix(G, π) be the maximum integer k such that there exists a crossing-free redrawing π′ of G which keeps k vertices fixed, i.e., there exist k vertices v1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00442-8