← All problems

Linear-Volume 3D Grid Drawings of Planar Graphs

Does every nn-vertex planar graph have a 3D grid drawing with O(n)O(n) volume? A 3D grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates such that the straight line segments representing the edges are pairwise non-crossing. The volume is of the bounding box.

Coming soon

Organizer

Boyuan Wang portraitBoyuan Wang
Minghan Wang portraitMinghan Wang
Bochao Li portraitBochao Li
Hongwei Hu portraitHongwei Hu