Drawing K₂,n: A lower bound

DOI10.1016/S0020-0190(02)00433-7MaRDI QIDQ1007548zbMATH OpenOpenAlexFDO

Authors Timothy M. Chan, Alejandro Lopez-Ortiz, Therese Biedl

Publication date 23 March 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(02)00433-7

zbMATH Keywords

aspect ratiocomputational geometrygraph drawingplanar embeddings

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Lower bounds for planar orthogonal drawings of graphs
• A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
• Bounding the number of non-duplicates of the \(q\)-side in simple drawings of \(K_{p,q}\)
• An improved bound on the one-sided minimum crossing number in two-layered drawings
• Geometric drawings of \(K_{n}\) with few crossings
• New Lower Bounds For Orthogonal Drawings
• The Complexity of Drawing Graphs on Few Lines and Few Planes
• The complexity of drawing graphs on few lines and few planes
• The optimal drawings of \(K_{5,n}\)
• Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics

Cites work

• An introduction to the geometry of numbers.
• scientific article; zbMATH DE number 2084287 (Why is no real title available?)
• scientific article; zbMATH DE number 3032896 (Why is no real title available?)

Cited in

(5)

• There is a unique crossing-minimal rectilinear drawing of \(K_{18}\)
• Bishellable drawings of K_n
• The optimal drawings of \(K_{5,n}\)
• Levi's Lemma, pseudolinear drawings of , and empty triangles
• A Lower Bound on the Area Requirements of Series-Parallel Graphs

This page was built for publication: Drawing \(K_{2,n}\): A lower bound

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