We extend the concept of rectangular drawing to drawings on a sphere using meridians and circles of latitude such that each face is bounded by at most two circles and at most two meridians. This is called spherical-rectangular drawing. Special cases include drawing on a cylinder, a cone, or a lattice of concentric circles on the plane. In this paper, we prove necessary and sufficient conditions for cubic planar graphs to have spherical-rectangular drawings, and show that one can find in linear time a spherical-rectangular drawing of a subcubic planar graph if it has one
Clustered graphs are graphs with recursive clustering structures over the vertices. For graphical re...
We consider the problem of intersection-free planar graph morphing, and in particular, a generaliza...
Clustered graphs are graphs with recursive clustering structures over the vertices. For graphical re...
Rectangular drawings and rectangular duals can be naturally extended to other surfaces. In this pape...
A plane graph is a planar graph with a fixed embedding. In a rectangular drawing of a plane graph, e...
AbstractRectangular drawings and rectangular duals can be naturally extended to other surfaces. In t...
AbstractThis paper addresses the problem of finding rectangular drawings of plane graphs, in which e...
AbstractThe rectangular grid drawing of a plane graph G is a drawing of G such that each vertex is l...
A plane graph is a planar graph with a fixed planar embedding in the plane. In a box- rectangular dr...
International audienceWe consider the problem of computing a spherical crossing-free geodesic drawin...
Ortho-Radial drawings are a generalization of orthogonal drawings to grids that are formed by concen...
In a rectangular drawing of a plane graph, each edge is drawn as a horizontal or vertical line segme...
Abstract: In this paper, we will introduce a method how to draw the orthogonal projected images of ...
Motivated by the successful application of geometry to proving the Harary--Hill conjecture for “pseu...
Using structural geometric arguments, Whiteley showed that a line drawing is a correct projection of...
Clustered graphs are graphs with recursive clustering structures over the vertices. For graphical re...
We consider the problem of intersection-free planar graph morphing, and in particular, a generaliza...
Clustered graphs are graphs with recursive clustering structures over the vertices. For graphical re...
Rectangular drawings and rectangular duals can be naturally extended to other surfaces. In this pape...
A plane graph is a planar graph with a fixed embedding. In a rectangular drawing of a plane graph, e...
AbstractRectangular drawings and rectangular duals can be naturally extended to other surfaces. In t...
AbstractThis paper addresses the problem of finding rectangular drawings of plane graphs, in which e...
AbstractThe rectangular grid drawing of a plane graph G is a drawing of G such that each vertex is l...
A plane graph is a planar graph with a fixed planar embedding in the plane. In a box- rectangular dr...
International audienceWe consider the problem of computing a spherical crossing-free geodesic drawin...
Ortho-Radial drawings are a generalization of orthogonal drawings to grids that are formed by concen...
In a rectangular drawing of a plane graph, each edge is drawn as a horizontal or vertical line segme...
Abstract: In this paper, we will introduce a method how to draw the orthogonal projected images of ...
Motivated by the successful application of geometry to proving the Harary--Hill conjecture for “pseu...
Using structural geometric arguments, Whiteley showed that a line drawing is a correct projection of...
Clustered graphs are graphs with recursive clustering structures over the vertices. For graphical re...
We consider the problem of intersection-free planar graph morphing, and in particular, a generaliza...
Clustered graphs are graphs with recursive clustering structures over the vertices. For graphical re...