Convex drawings of graphs in two and three dimensions (preliminary version)
Proceedings of the twelfth annual symposium on Computational geometry
Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Planar minimally rigid graphs and pseudo-triangulations
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Convex drawings of graphs with non-convex boundary
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Hi-index | 0.00 |
We show that every plane graph admits a planar straight-line drawing in which all faces with more than three vertices are non-convex polygons.