Chapter

Graph Drawing

Volume 7034 of the series Lecture Notes in Computer Science pp 238-241

Realizing Planar Graphs as Convex Polytopes

  • Günter RoteAffiliated withInstitut für Informatik, Freie Universität Berlin

Abstract

This is a survey on methods to construct a three-dimensional convex polytope with a given combinatorial structure, that is, with the edges forming a given 3-connected planar graph, focusing on efforts to achieve small integer coordinates.

Keywords

Convex polytope spiderweb embedding