19 search results - page 3 / 4 » Area-universal rectangular layouts |
INFOVIS
2005
IEEE
13 years 11 months ago
2005
IEEE
Treemaps are a well-known method for the visualization of attributed hierarchical data. Previously proposed Treemap layout algorithms are limited to rectangular shapes, which caus...
COMPGEOM
1997
ACM
13 years 10 months ago
1997
ACM
An effective and fast algorithm is given for rotational overlap minimization: given an overlapping layout of polygons P1, P2, P3, . . . , Pk in a container polygon Q, translate an...
COR
2007
13 years 5 months ago
2007
This paper presents an algorithm for the unconstrained two-dimensional cutting problem of rectangular pieces. It proposes the two-stage general block pattern that can be cut into ...
GRAPHICSINTERFACE
2000
13 years 7 months ago
2000
With the advent of image based modeling techniques, it becomes easier to apply textures extracted from reality onto virtual worlds. Many repetitive patterns (structural textures) ...
EOR
2007
13 years 5 months ago
2007
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...