We consider the question of whether a given graph drawing Γ of a triconnected planar graph G is a weighted barycenter drawing. We answer the question with an elegant arithmetic characterisation using the faces of Γ. This leads to positive answers when the graph is a Halin graph, and to a polynomial time recognition algorithm when the graph is cubic.
@article{arxiv.1809.00628,
title = {The Weighted Barycenter Drawing Recognition Problem},
author = {Peter Eades and Patrick Healy and Nikola S. Nikolov},
journal= {arXiv preprint arXiv:1809.00628},
year = {2018}
}
Comments
Appears in the Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018)