Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids

DOI10.1007/978-3-642-10631-6_77zbMATH Open1273.68394OpenAlexW1539289695MaRDI QIDQ3652262

Xiao Zhou, Takao Nishizeki

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_77

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Title not available (Why is that?) 👍 👎
• Strictly convex drawings of planar graphs 👍 👎
• Convex drawings of 3-connected plane graphs 👍 👎
• Convex grid drawings of planar graphs with constant edge-vertex resolution 👍 👎
• On orthogonally convex drawings of plane graphs 👍 👎
• On Orthogonally Convex Drawings of Plane Graphs 👍 👎
• CONVEX DRAWINGS OF INTERNALLY TRICONNECTED PLANE GRAPHS ON O(n²) GRIDS 👍 👎
• Graph Drawing 👍 👎
• A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs 👍 👎
• Strictly-convex drawings of 3-connected planar graphs 👍 👎

This page was built for publication: Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3652262)