Convex drawings of graphs with non-convex boundary constraints
From MaRDI portal
Publication:947122
DOI10.1016/j.dam.2007.10.012zbMath1144.05023OpenAlexW2017807009MaRDI QIDQ947122
Seok-Hee Hong, Hiroshi Nagamochi
Publication date: 29 September 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.10.012
graph drawingconvex drawingtriconnected planar graphsstar-shaped polygonscrown-shaped polygonsfour-connected planar graphs
Related Items
The Complexity of Drawing a Graph in a Polygonal Region, Straight-Line Drawability of a Planar Graph Plus an Edge, One-bend drawings of outerplanar graphs inside simple polygons, Extending convex partial drawings of graphs, The segment number: algorithms and universal lower bounds for some classes of planar graphs, A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners, Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints, Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra, The complexity of drawing a graph in a polygonal region, \(\beta\)-stars or on extending a drawing of a connected subgraph, Unnamed Item, Convex drawings of hierarchical planar graphs and clustered planar graphs, A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs, Drawing Simultaneously Embedded Graphs with Few Bends, An algorithm for constructing star-shaped drawings of plane graphs, A polynomial bound for untangling geometric planar graphs, Untangling a planar graph, Planar drawings of fixed-mobile bigraphs, Free edge lengths in plane graphs
Cites Work
