Rectangular grid drawings of plane graphs
From MaRDI portal
Publication:1392851
DOI10.1016/S0925-7721(98)00003-0zbMath0901.68202OpenAlexW2066705499MaRDI QIDQ1392851
Md. Saidur Rahman, Takao Nishizeki, Shin-ichi Nakano
Publication date: 19 November 1998
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(98)00003-0
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer system organization (68M99)
Related Items
Planar polyline drawings via graph transformations, Drawings of planar graphs with few slopes and segments, Aspect ratio universal rectangular layouts, Unit-length rectangular drawings of graphs, An annotated review on graph drawing and its applications, Grid recognition: classical and parameterized computational perspectives, Unnamed Item, Rectangular-radial drawings of cubic plane graphs, Spherical-Rectangular Drawings, Rectangular drawings of plane graphs without designated corners, Octagonal drawings of plane graphs with prescribed face areas, INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Drawing plane graphs nicely
- On area-efficient drawings of rectangular duals for VLSI floor-plan
- How to draw a planar graph on a grid
- A linear algorithm to find a rectangular dual of a planar triangulated graph
- Planar graphs: Theory and algorithms
- Minimum-width grid drawings of plane graphs
- Algorithms for drawing graphs: An annotated bibliography
- Grid embedding of 4-connected plane graphs
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
- On minimal-node-cost planar embeddings
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- On Finding the Rectangular Duals of Planar Triangular Graphs
- Optimal orthogonal drawings of triconnected plane graphs
