Spectral methods are naturally suited for dynamic graph layout because, usually, moderate changes of a graph yield moderate changes of the layout. We discuss some general principles for dynamic graph layout and derive a dynamic spectral layout approach for the animation of small-world models. Article Type Communicated by Submitted Revised Regular paper P. Eades and P. Healy January 2006 January...

Plant layout design is related to the location of facilities (e.g. machines, departments) in a plant. They are known to greatly impact the system performance. Numerous research works related to facility layout have been published. A few literature reviews exist, but they are not recent or are restricted to certain specific aspects of these layout design. The literature analysis given here is re...

This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...

This paper presents the development of an Intelligent Cavity Layout Design System (ICLDS) for multiple cavity injection moulds. The system is intended to assist mould designers in cavity layout design at concept design stage. The complexities and principles of cavity layout design as well as various dependencies in injection mould design are introduced. The knowledge in cavity layout design is ...

Spectral methods are naturally suited for dynamic graph layout, because moderate changes of a graph yield moderate changes of the layout under weak assumptions. We discuss some general principles for dynamic graph layout and derive a dynamic spectral layout approach for the animation of small-world models.

this paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. by this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. this is resulted from dividing area into discrete and continuous dimensions. also defining decision var...

We address the new problem of puzzle layout as a new application of graph drawing. We present two abstract models of puzzles, permutation puzzles and cyclic puzzles, which can be modeled as puzzle graphs. Based on these models, we implement two puzzle generators and produce various layouts of the puzzles using graph drawing algorithms. Using these puzzle generators we can create new puzzles. Fu...

The question of plant layout is central in a manufacturing process. This question becomes even more important in a mass customization context, when large product diversity has to be managed. The manufacturing process, and specifically the plant layout, has to be designed taking into account this characteristic. When all products are similar, manufacturing plant layouts are relatively easy to de...

The rapid development of exible, layout independent web sites is an increasingly important problem. Flexibility, scalability and the ability to adapt to evolving layout requirements is a key success factor for many web sites. A fundamental way to meet these requirements is to strictly separate business logic from the layout and the content. The World Wide Web Consortium's XML and XSL standards ...