A problem of survivable layout of an IP network topology on a wavelength division multiplexed network is considered. Simple layout algorithms are given that have low time complexities. The algorithms are variations of a basic algorithm, that lays out IP links as lightpaths sequentially according to some order and with respect to link costs. Simulations show that the ordering and link costs can ...

Visualisations implemented as virtual worlds can allow users to comprehend large graphs more effectively. Good 3D layout algorithms are an important element. Angle has been developed as a platform for experimenting with 3D force-directed layout algorithms. The big-bang modification is proposed as a means of obtaining efficiently good 3D layouts for a wide range of graphs. Results are presented ...

Based on the theory and technology of data visualization, this paper improves some layout algorithms regarding its own natures and characteristics. It also discusses the problem of how to choose proper layout algorithm for specific data to make the visualization better. Using the improved algorithms, we can simply convert a series of complex data into more expressive images as to convey the imp...

In this paper we investigate the general position model for the drawing of arbitrary degree graphs in the D-dimensional (D ≥ 2) orthogonal grid. In this model no two vertices lie in the same grid hyperplane. We show that for D ≥ 3, given an arbitrary layout and initial edge routing a crossing-free orthogonal drawing can be determined. We distinguish two types of algorithms. Our layout-based alg...

Electron-beam direct-write (EBDW) lithography systems must in the future transmit terabits of information per second to be viable for commercial semiconductor manufacturing. Lossless layout image compression algorithms with high decoding throughputs and modest decoding resources are tools to address the data transfer portion of the throughput problem. The earlier lossless layout image compressi...

A usability requirement for interactive layout assistance systems is the principle of least astonishment (Borning et al. 1987) which states that the system should arrange the layout in a way that conforms to the user’s expectations. This paper presents a framework for transformation-based similarity between two-dimensional spatial configurations. Here, similarity is intended to measure the user...

Treemaps, a space-filling method of visualizing large hierarchical data sets, are receiving increasing attention. Several algorithms have been proposed to create more useful displays by controlling the aspect ratios of the rectangles that make up a treemap. While these algorithms do improve visibility of small items in a single layout, they introduce instability over time in the display of dyna...