Skyscraper polytopes and realizations of plane triangulations

DOI10.1016/J.JCTB.2017.05.007MaRDI QIDQ2407381zbMATH OpenOpenAlexFDO

Authors Igor Pak, Stedman Wilson

Publication date 29 September 2017

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jctb.2017.05.007

zbMATH Keywords

convexembedgridsheddingsimplicial polytopeSteinitz theoremtriangulation

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Recommendations

• Small grid embeddings of 3-polytopes
• A Duality Transform for Constructing Small Grid Embeddings of 3D Polytopes
• Embedding 3-polytopes on a small grid

Cites work

• A quantitative Steinitz' theorem
• A unified approach to visibility representations of planar graphs
• An upper bound for the number of planar lattice triangulations
• Analytic combinatorics
• Compact visibility representation of 4-connected plane graphs
• Convex polytopes: extremal constructions and f-vector shapes
• Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
• Drawing 3-polytopes with good vertex resolution
• How to Draw a Graph
• How to draw a planar graph on a grid
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 1943970 (Why is no real title available?)
• scientific article; zbMATH DE number 1996253 (Why is no real title available?)
• scientific article; zbMATH DE number 3047038 (Why is no real title available?)
• Improved visibility representation of plane graphs
• Lectures on Polytopes
• Nearly Optimal Visibility Representations of Plane Graphs
• On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
• On the diameter of random planar graphs
• On the number of convex lattice polytopes
• On the number of spanning trees a planar graph can have
• Optimal st-orientations for plane triangulations
• Random triangulations of planar points sets
• Realization spaces of polytopes
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Small grid embeddings of 3-polytopes
• Strictly convex drawings of planar graphs

Cited in

(3)

• A quantitative Steinitz' theorem
• A duality transform for realizing convex polytopes with small integer coordinates
• The efficient shape of a skyscraper based on the vertical traffic

This page was built for publication: Skyscraper polytopes and realizations of plane triangulations

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