Sciweavers

19 search results - page 2 / 4
» Area-universal rectangular layouts
Sort
View
ISCC
2006
IEEE
127views Communications» more  ISCC 2006»
13 years 11 months ago
Visualizing and Managing Network Topologies via Rectangular Dualization
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
Massimo Ancona, Walter Cazzola, Sara Drago, Gianlu...
ISAAC
2004
Springer
98views Algorithms» more  ISAAC 2004»
13 years 10 months ago
Inner Rectangular Drawings of Plane Graphs
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. An inner ...
Kazuyuki Miura, Hiroki Haga, Takao Nishizeki
EOR
2006
93views more  EOR 2006»
13 years 5 months ago
A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
Given a set of rectangular pieces and a container of fixed width and variable length, the two-dimensional strip packing problem (2D-SPP) consists of orthogonally placing all the p...
Andreas Bortfeldt
AUIC
2006
IEEE
13 years 11 months ago
User interface layout with ordinal and linear constraints
User interfaces as well as documents use tabular layout mechanisms. The HTML table construct and the GridBag layout in Java are typical examples. There are, however, shortcomings ...
Christof Lutteroth, Gerald Weber
GD
2004
Springer
13 years 10 months ago
Layouts of Graph Subdivisions
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
Vida Dujmovic, David R. Wood