Drawing Simultaneously Embedded Graphs with Few Bends

نویسندگان

  • Luca Grilli
  • Seok-Hee Hong
  • Jan Kratochvíl
  • Ignaz Rutter
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Drawing Partially Embedded and Simultaneously Planar Graphs

We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem—to extend a straight-line planar drawing of a subgraph to a planar drawing of the whole graph—and the simultaneous planarity problem—to find planar drawings of two graphs that coincide on shared vertices and edges. In both cases we show that if the required pl...

متن کامل

Simultaneous Embedding of Planar Graphs with Few Bends

We consider several variations of the simultaneous embedding problem for planar graphs. We begin with a simple proof that not all pairs of planar graphs have simultaneous geometric embedding. However, using bends, pairs of planar graphs can be simultaneously embedded on the O(n) × O(n) grid, with at most three bends per edge, where n is the number of vertices. The O(n) time algorithm guarantees...

متن کامل

A Better Heuristic for Orthogonal Graph Drawings

16 We end this paper by mentioning some open problems and directions for further research: Valiant proved that a grid-area of (n 2) is necessary for drawing non-planar graphs, since the crossing number can be (n 2) 26]. However, the involved constants are very small. For planar graphs (crossing number 0) a drawing with grid-area O(n log 2 n) is possible 14, 26], and the best known lower bound i...

متن کامل

Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends

Given two planar graphs that are defined on the same set of vertices, a RAC simultaneous drawing is a drawing of the two graphs where each graph is drawn planar, no two edges overlap, and edges of one graph can cross edges of the other graph only at right angles. In the geometric version of the problem, vertices are drawn as points and edges as straight-line segments. It is known, however, that...

متن کامل

The Minimum Bends in a Polyline Drawing with Fixed Vertex Locations

We consider embeddings of planar graphs in R where vertices map to points and edges map to polylines. We refer to such an embedding as a polyline drawing, and ask how few bends are required to form such a drawing for an arbitrary planar graph. It has long been known that even when the vertex locations are completely fixed, a planar graph admits a polyline drawing where edges bend a total of O(n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014