A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs
DOI10.1007/S00453-008-9275-YzbMATH Open1205.68262OpenAlexW2087570494MaRDI QIDQ5961977FDOQ5961977
Authors: Seok-Hee Hong, Hiroshi Nagamochi 
Publication date: 16 September 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9275-y
Recommendations
- scientific article; zbMATH DE number 2119683
- A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs
- Drawing planar graphs symmetrically. III: Oneconnected planar graphs
- Drawing planar graphs symmetrically. II: Biconnected planar graphs
- Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids
symmetryplanar graphsgraph drawingtriconnected planar graphsconvex drawinggeometric automorphismangle-constrained graph drawinginternally triconnected plane graphssymmetric drawing
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Generalized Nested Dissection
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- How to Draw a Graph
- Some NP-Complete Problems Similar to Graph Isomorphism
- Convex drawings of graphs with non-convex boundary constraints
- A reductive technique for enumerating non-isomorphic planar maps
- Time bounded random access machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex Representations of Graphs
- CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
- CONVEX DRAWINGS OF PLANE GRAPHS OF MINIMUM OUTER APICES
- Graph Drawing
- Strictly convex drawings of planar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex Grid Drawings of Plane Graphs with Rectangular Contours
- Spring algorithms and symmetry
- Drawing planar graphs symmetrically. II: Biconnected planar graphs
- Drawing planar graphs symmetrically. III: Oneconnected planar graphs
- Title not available (Why is that?)
- Algorithms and Computation
- Fast detection and display of symmetry in outerplanar graphs
- Drawing series parallel digraphs symmetrically
- A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs
Cited In (6)
- Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids
- Title not available (Why is that?)
- Title not available (Why is that?)
- A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
- A force-directed algorithm for drawing directed graphs symmetrically
Uses Software
This page was built for publication: A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961977)
