Sciweavers

19 search results - page 1 / 4
» Convex Grid Drawings of Four-connected Plane Graphs
Sort
View
JGAA
2008
100views more  JGAA 2008»
13 years 11 months ago
Convex Grid Drawings of Plane Graphs with Rectangular Contours
In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection and all facial cycles are drawn as convex polygons. In a convex gr...
Kazuyuki Miura, Akira Kamada, Takao Nishizeki
GD
2004
Springer
14 years 4 months ago
Convex Drawings of 3-Connected Plane Graphs
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...
Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah
IJFCS
2006
70views more  IJFCS 2006»
13 years 11 months ago
Convex Grid Drawings of Four-connected Plane Graphs
Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki
DAM
2008
92views more  DAM 2008»
13 years 11 months ago
Convex drawings of graphs with non-convex boundary constraints
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...
Seok-Hee Hong, Hiroshi Nagamochi
JDA
2010
131views more  JDA 2010»
13 years 9 months ago
Convex drawings of hierarchical planar graphs and clustered planar graphs
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
Seok-Hee Hong, Hiroshi Nagamochi