Shortest path embeddings of graphs on surfaces

Alfredo Hubard, Vojtěch Kaluža, Arnaud de Mesmay +1

The classical theorem of Fáry states that every planar graph can be represented by an embedding in which every edge is represented by a straight line segment. We consider generaliz…