In this paper we study the problem of computing homothetic triangle contact representations of planar graphs. Since not all planar graphs admit such a representation, we concentrate on meaningfulâ€¦ (More)

Canonical ordering is an important tool in planar graph drawing and other applications. Although a linear-time algorithm to determine canonical orderings has been known for a while, it is ratherâ€¦ (More)

Canonical ordering is an important tool in planar graph drawing and other applications. Although a linear-time algorithm to determine canonical orderings has been known for a while, it is ratherâ€¦ (More)

Let G be a planar graph with n vertices whose vertex set is partitioned into subsets V0, . . . , Vkâˆ’1 for a positive integer 1 â‰¤ k â‰¤ n and let S be a set of n distinct points in the plane partitionedâ€¦ (More)

Let G be a planar graph with n vertices whose vertex set is partitioned into subsets V0, . . . , Vkâˆ’1 for some positive integer 1 â‰¤ k â‰¤ n and let S be a set of n distinct points in the planeâ€¦ (More)