A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
A proportional contact representation of a planar graph is one where each vertex is represented by a simple polygon with area proportional to a given weight and adjacencies between polygons represent edges between the corresponding pairs of vertices. In this paper we study proportional contact representations that use only rectilinear polygons and contain no unused area or hole. There is an algorithm that gives a hole-free proportional contact representation of a maximal planar graph withdoi:10.1007/978-3-642-25591-5_30 fatcat:5qnfgojplfc4pa7n2s2ocmal54