Ihor Strykhalyuk

  • Citations Per Year
Learn More
In this paper we present a greedy routing scheme for planar 3-connected graphs. The embedding is in R<sup>2</sup>, but the proximity measure used is not Euclidean. We show the relationship between our embedding and classical circle packings and described a modification of the Thurston algorithm originally designed for generating circle packings, so that it(More)
  • 1