We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizing this layout has a direct impact on the I/O performance of the entire system. The traditional approach of striping each object across all available disk drives is aimed at optimizing I/O parallelism; however, it is s...

Graph drawing and layout algorithms gain growing interest and importance for the visualization of complex data structures. But, despite many algorithms and concepts, there is no satisfactory solution to the central problem on the criteria for good and readable layouts. We approach this problem and evaluate layout algorithms by comparing their eeect on a large set of sample graphs. In each run w...

In this paper an effort is made to present a state-of-the-art review of meta-heuristic approaches in solving facility layout problems. Facility layout directly affects the productivity of the industries so it is very important to solve it carefully. There are many approaches, methods and techniques to solve and optimize the layout problem. The current and future trends involving design objectiv...

The visual impact of wind farm layouts has seen little consideration in the literature on the wind farm layout optimisation problem to date. Most existing algorithms focus on optimising layouts for power or the cost of energy alone. In this paper, we consider the geometry of wind farm layouts and whether it is possible to bi-optimise a layout for both energy efficiency and the degree of visual ...

Layout veriication determines whether the polygons that represent diierent mask layers in the chip conform to the technology speciications. Commercial layout verii-cation programs can take tens of hours to run in the attened representations for large designs. It is therefore desirable to run the DRC problem in parallel to reduce the runtimes. Also, the memory requirements of large chips are suc...

Many clustering and layout techniques have been used for structuring and visualising complex data. This paper explores a number of combinations and variants of sampling, K-means clustering and spring models in making such layouts, using Chalmers’ 1996 linear iteration time spring model as a benchmark. This algorithm runs in O(N) time overall, but the run times for the new algorithms we describe...

This paper presents geometric algorithms for solving two key problems in layout analysis: finding a cover of the background whitespace of a document in terms of maximal empty rectangles, and finding constrained maximum likelihood matches of geometric text line models in the presence of geometric obstacles. The algorithms are considerably easier to implement than prior methods, they return globa...

Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maintain a user’s mental picture of the original layout. We present a new approach to layout adjustment called cluster busting in anchored graph drawing. We then give two algorithms as examples of this approach. The goals o...

Genetic Algorithms are widely used in many different optimization problems including layout design. The layout of the shelves play an important role in the total sales metrics for superstores since this affects the customers’ shopping behaviour. This paper employed a genetic algorithm based approach to design shelf layout of superstores. The layout design problem was tackled by using a novel ch...