Lower Bounds for Planar Orthogonal Drawings of Graphs
نویسندگان
چکیده
We study planar orthogonal drawings of graphs and provide lower bounds on the number of bends along the edges. We exhibit graphs on n vertices that require (n) bends in any layout, and show that there exist optimal drawings that require (n) bends and have all of them on a single edge of length (n 2). This work nds applications in VLSI layout, aesthetic graph drawing, and communication by light or microwave.
منابع مشابه
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...
متن کاملAlgorithms for Area-E cient Orthogonal Drawings
An orthogonal drawing of a graph is a drawing such that nodes are placed on grid points and edges are drawn as sequences of vertical and horizontal segments. In this paper we present linear time algorithms that produce orthogonal drawings of graphs with n nodes. If the maximum degree is four, then the drawing produced by our algorithm needs area no greater than 0:76n 2 , and introduces no more ...
متن کاملAlgorithms for Area-eecient Orthogonal Drawings
An orthogonal drawing of a graph is a drawing such that nodes are placed on grid points and edges are drawn as sequences of vertical and horizontal segments. In this paper we present linear time algorithms that produce orthogonal drawings of graphs with n nodes. If the maximum degree is four, then the drawing produced by our rst algorithm needs area at most (roughly) 0:76n 2 , and introduces at...
متن کاملAlgorithms and Bounds for Overloaded Orthogonal Drawings
Orthogonal drawings are widely used for graph visualization due to their high clarity and ease of representation. But when it comes to highdegree and massive graphs, even orthogonal drawings have difficulties producing a clean and simple visualization. In this paper we present a technique called Overloaded Orthogonal Drawing that greatly improves the readability by proposing a new vertex placem...
متن کاملArea-Efficient Static and Incremental Graph Drawings
In this paper, we present algorithms to produce orthogonal drawings of arbitrary graphs. As opposed to most known algorithms, we do not restrict ourselves to graphs with maximum degree 4. The best previous result gave an (m ? 1) (m 2 + 1)-grid for graphs with n nodes and m edges. We present algorithms for two scenarios. In the static scenario, the graph is given completely in advance. We produc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 39 شماره
صفحات -
تاریخ انتشار 1991