QUINN,N.AND BREUER,M. 1979. A force-directed component placement procedure for printed circuit boards. IEEE Trans. Circ Syst CAS CAS-26, 377--388.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....we turn to their visualisation. We experimented with two approaches: The first one is based on matrix theory and singular value decomposition [9] It comes up with an exact solution if such a solution exists and otherwise with an approximation. The second approach is based on spring embedding [14], a heuristic which cannot guarantee to find the best solution but 7 Figure 5: A screenshot of the animated argumentation trace generated. Figure 6: A snapshot of the communicative agents. Bright spheres are generated by the matrix theory algorithm, dark ones by spring embedding. which is ....

N. R. Quinn and M. A. Breuer. A force directed component placement procedure for printed cicuit boards. IEEE Transactions on Circuits and systems, CAS-26(6):377--388, 1979.

....given in the proximity data. The target space can then be visualised as a scatterplot. Proximity data can be seen as a label, fully connected, undirected graph and as a result graph drawing techniques can be useful for multi dimensional scaling. One such graph drawing method is spring embedding [Kru64, QB79, KK89, FR91, AAH94, RD96, Tun99, BETT99]. Spring embedding is a local optimisation technique, which starts with an initial (usually random) layout and then iteratively improves this layout by viewing edges between nodes as springs, thus leading to attractive and repulsive forces based on the desired distance between the nodes. Nodes ....

....Applied to the above data set, one obtains the dendrogram in Fig. 3, which has ben additionally enriched by a colour map. 2.3 Spring Embedding Before we explain how to use spring embedding as a non linear multi dimensional scaling technique, let us review spring embedding. Spring embedding [Kru64, QB79, KK89, FR91, AAH94, RD96, Tun99, BETT99] uses the physical metaphor of springs (see Fig. 4) According to Hooke s law, there are attractive and repulsive forces based on the desired distance between the nodes. The Spring embedding algorithm starts with a random layout and then computes Figure 3: Dendrogram visualisation [ESBB98] for ....

[Article contains additional citation context not shown here]

N. R. Quinn and M. A. Breuer. A force directed component placement procedure for printed cicuit boards. IEEE Transactions on Circuits and systems, CAS-26(6):377-388, 1979.

....0, then there is only a solution in R and X contains a mapping to R which is best since it is based on the greatest eigenvalues l 1 and l 3 . b) Else X is the solution, i.e. d e (x i ; x j ) d i j . 8.2. 3 Spring Embedding An alternative to the above layout algorithm is spring embedding [47,48]. We use the physical metaphor of springs connecting the objects (see Fig. 31) and leading 34 B C B A C Fig. 31. Multi dimensional scaling with spring embedding. Nodes are moved into the direction of the sum of forces. to attractive and repulsive forces based on the desired distance between ....

N. R. Quinn, M. A. Breuer, A force directed component placement procedure for printed cicuit boards, IEEE Transactions on Circuits and systems CAS-26 (6) (1979) 377--388.

....algorithm, graph editing. INTRODUCTION A graph is a simple, powerful, and elegant abstraction, which has a broad applicability with the visualization technique in computer science and many related fields. Force Directed Placement is a well known technique for drawing general undirected graphs [1 5]. Many models and algorithms have been proposed for the Force Directed Placement, such as spring model by Eades[2] magnetic spring model by Sugiyama [6] and others[3 5] These models and algorithms are just designed and applied for graph drawing in two dimensional space. Lately, some algorithms ....

N. Quinn and M. Breur. A Force Directed Component Placement Procedure for Printed Circuit Boards. IEEE Transactions of Circuits and Systems, 26(6): 377-388, 1979.

....those where all nodes have at least one edge. For the purposes of layout a non connected graph can be considered as multiple connected graphs so the extension to include non connected graphs should not prove difficult. Eades [9] following from previous work on printed circuit board layout [31], first proposed a spring based graph layout methodology in 1983. The principle behind this class of layout algorithms is to consider the nodes of a graph as rings or balls that are connected by edges modelled as steel springs, as shown in Figure 4.1. The idea being that if the nodes are ....

N. Quinn and M. Breur. A force directed component placement procedure for printed circuit boards. IEEE Trans. Circuits and Systems, CAS-26(6):377--388, 1979.

....trivial for some architectures such as the partial crossbar, where any random placement is acceptable because the number of wires between any pair of FPGAs is the same. A Force Directed Placement Algorithm Force directed placement algorithms have been used for board level placement of IC chips [Quin79, Goto81] and could potentially be used for placement in the mesh architectures. Force directed algorithms are rich in variety and differ greatly in implementation details [Shah91] The common element in these algorithms is the method used to calculate the location where a module (sub circuit) should be ....

N. R. Quinn, M. A. Breuer, "A Force Directed Component Placement Procedure for Printed Circuit Boards," IEEE Trans. on Circuits and Systems, Vol. 26, No. 6, pp. 377-388, June 1979.

....x j ) q m k=1 (x ki x k j ) 2 between x i and x j is d i j . The literature on multi dimensional scaling [7, 4, 10, 12, 20] provides solutions for this problem and in the context of agent systems [17] describes two algorithms based on singular value decomposition [20] and spring embedding [15]. 3.4 The choice of distance is paramount for analysis The choice of an appropriate distance is the most crucial step in the visualisation process, and can drastically affect the outcome. Fig. 1 (left and middle) illustrates this with a simple example, where two different distance measures ....

N. R. Quinn and M. A. Breuer. A force directed component placement procedure for printed cicuit boards. IEEE Transactions on Circuits and systems, CAS-26(6):377--388, 1979.

..... 2 In [21] we experimented with two approaches to solve this problem: The first one is based on matrix theory and singular value decomposition [11] It comes up with an exact solution if such a solution exists and otherwise with an approximation. The second approach is based on spring embedding [18], a heuristic which cannot guarantee to find the best solution but which is dynamic and flexible. Intuitively, it is easy to construct a geometric solution. Consider Figure 8. We place a compass at a random position on the paper and start drawing circles with radii d 1i . Then we position the ....

....unintuitive and difficult to perceive. An alternative is to use more than the three spatial dimension to visualize the higher dimensional solution by mapping the forth, fifth, and sixth dimension to the colors red, yellow, and blue. The second approach described in [21] is spring embedding [18]. For the layout of the agents with the right distances it uses the physical 18 metaphor of springs connecting the agents and leading to attractive forces based on the desired distance between two agents. Additionally, there are repulsive forces between any pair of agents. The algorithm starts ....

N. R. Quinn and M. A. Breuer. A force directed component placement procedure for printed cicuit boards. IEEE Transactions on Circuits and systems, CAS-26(6):377-- 388, 1979.

....presented in this paper, allows us to create excellent initial embeddings in very reasonable times; hence, it can be used either by itself or as a preprocessing step to these large graph layout methods. 2. 3 Force Directed Algorithms The force directed placement algorithm of Quinn and Breur [35] and the spring embedder of Eades [12] are among the first practical algorithms for graph drawing. In the latter algorithm the graph is modeled as a physical system of rings and springs. Classical force directed methods start from a random embedding of a graph and utilize standard optimization ....

N. Quinn and M. Breur. A force directed component placement procedure for printed circuit boards. IEEE Transactions on Circuits and Systems, CAS-26(6):377--388, 1979.

....presented in this paper, allows us to create excellent initial embeddings in very reasonable times; hence, it can be used either by itself or as a preprocessing step to these large graph layout methods. 2. 3 Force Directed Algorithms The force directed placement algorithm of Quinn and Breur [35] and the spring embedder of Eades [12] are among the rst practical algorithms for graph drawing. In the latter algorithm the graph is modeled as a physical system of rings and springs. Classical force directed methods start from a random embedding of a graph and utilize standard optimization ....

N. Quinn and M. Breur. A force directed component placement procedure for printed circuit boards. IEEE Transactions on Circuits and Systems, CAS-26(6):377-388, 1979.

....and geometrical constraints must be fulfilled simultaneously. A common formulation of the placement objective is to minimize wire length under the constraint that cells don t overlap each other. Early formulations of the placement problem use forces for reducing the overlaps between cells [1]. Complexity and convergence problems quickly led to the development of more powerful methods. The current state of the art placement tools for handling large designs can be classified into two categories based on how they make sure that the placement is free of overlaps. The first class consists ....

N. Quinn and M. Breuer, "A force directed component placement procedure for printed circuit boards," IEEE Trans. CAS, vol. CAS-26, pp. 377--388, June 1979.

....two into one subsystem) For the visualisation of the two different approaches (CrocoBrowse vs. other tools) we used Spring embedding and principle component analysis. 5.1. 1 Spring embedding visualisation (SEV) The spring embedder model is a heuristic for force directed placement of graphs (cf. [QuBr79], Eade84] Nodes are considered as mutually repulsive charges and edges as springs that attract connected nodes. In our situation all nodes have springs to all other nodes. Two nodes are in force balance if the geometric distance in the output is like the distance of cd. Two nodes attract each ....

Quinn Jr., N. R.; Breuer, M. A.: "A Force Directed Component Placement Procedure for Printed Circuit Boards", IEEE Trans. on Circuits and Systems, CAS-26(6), pp. 377-388, 1979.

....triangle inequality, which states that the direct distance between two objects is the shortest. This is important, as it is our intuitive conception of space and therefore desirable to apply to the distance metric used. Regarding (2) we will develop two approaches, one based on spring embedding (Quinn Breuer 1979) and the other one on singular value decomposition (Schroeder 1999; Goldberg 1991) Regarding (3) we show how to facilitate interactive exploration of the generated worlds using VRML. A design methodology for distance metrics In this section we develop a design methodology for distance metrics. ....

....l n = 0, then there is only a solution in R m and X contains a mapping to R 3 which is best since it is based on the greatest eigenvalues l 1 and l 3 . 4b. Else X is the solution, i.e. jjx i ; x j jj 2 = d i j . Spring Embedding An alternative to the above layout algorithm is spring embedding (Quinn Breuer 1979). We use the physical metaphor of springs connecting the objects and leading to attractive forces based on the desired distance between them. Additionally, there are repulsive forces between any pair of objects. The algorithm starts with a random layout and then computes for a number of iterations ....

Quinn, N. R., and Breuer, M. A. 1979. A force directed component placement procedure for printed cicuit boards. IEEE Transactions on Circuits and systems CAS-26(6):377--388.

....diagrams, class diagrams or benchmark diagrams. The introduced concept of distances within software systems allows for a more natural visualisation that maps the calculated measurement distances into geometrical distances. With well known algorithms like spring embedding algorithms (cf. [QuBr79], Eade84] or principal components analysis (cf. Ever93] FaHa84] the distance visualisation can be made very easy but nevertheless very powerful (cf. KRuSi99] With a well chosen visualisation the analysis and understanding of the data is much easier and more efficient. This again ....

....analysis, because both techniques try to optimise the problem of dimension reduction for visualisation in 2 or 3 dimensions and for both techniques ready to use tools exist. SPRING EMBEDDING VISUALISATION The spring embedder model is a heuristic for force directed placement of graphs (cf. [QuBr79], Eade84] Nodes are considered as mutually repulsive charges and edges as springs that attract connected nodes. In our situation all nodes have springs to all other nodes. Two nodes are in force balance if the geometric distance in the output is like the calculated distance. Two nodes attract ....

Quinn Jr., N. R.; Breuer, M. A.: "A Force Directed Component Placement Procedure for Printed Circuit Boards", IEEE Trans. on Circuits and Systems, CAS-26(6), pp. 377-388, 1979.

....and achieves consistent speedups with little quality degradation. The results of this thesis are limited to simulated annealing based placement algorithms. Recently, researchers have proposed alternate forms of placement algorithms such as simulated evolution [85, 86] force directed placement [87, 88], linear optimization based [89 91] and min cut based placement [92 94] Very little work has been done in developing parallel algorithms for these alternate approaches [95 97] New and more efficient parallel algorithms for these approaches must be investigated. The algorithms in this thesis ....

N. R. Quinn and M. A. Breuer, "A force directed component placement procedure for printed circuit boards," IEEE Transactions on Circuits and Systems, pp. 377--388, June 1979.

No context found.

QUINN,N.AND BREUER,M. 1979. A force-directed component placement procedure for printed circuit boards. IEEE Trans. Circ Syst CAS CAS-26, 377--388.

No context found.

Quinn, N. and Breuer, M. 1979. A force directed component placement procedure for printed circuit boards. IEEE Transactions on Circuits and Systems, 377--388.

No context found.

N.R. Quinn and M.A. Breuer. "A Force Directed Component Placement Procedure for Printed Circuit Boards." IEEE Transactions on Circuits and Systems, pp. 377--388, 1979. 163

No context found.

Quinn, N. and Breuer, M. 1979. A force directed component placement procedure for printed circuit boards. IEEE Transactions on Circuits and Systems, 377--388.

No context found.

N. Quinn and M. Breuer, \A force-directed component placement procedure for printed circuit boards," IEEE Trans. on Circuits and Systems CAS, vol. CAS-26, pp. 377{ 388, 1979.

No context found.

N. R. Quinn Jr. and M. A. Breuer, A force directed component placement procedure for printed circuit boards. IEEE Transactions on Circuits and Systems, CAS-26(6):377-388, 1979.

No context found.

N. R. Quinn Jr. and M. A. Breuer, A force directed component placement procedure for printed circuit boards. IEEE Transactions on Circuits and Systems, CAS-26(6):377-388, 1979.

No context found.

N. R. Quinn Jr. and M. A. Breuer, A force directed component placement procedure for printed circuit boards. IEEE Transactions on Circuits and Systems, CAS-26(6):377-388, 1979.

No context found.

N. Quinn, Jr. and M Breuer, "A Force Directed Component Placement Procedure for Printed Circuit Boards," IEEE Transactions on Circuits and Systems, vol. 26, no. 6, pp. 377-388, 1979.

No context found.

N. R. Quinn Jr. and M. A. Breuer, A force directed component placement procedure for printed circuit boards. IEEE Transactions on Circuits and Systems, CAS-26(6):377-388, 1979.

No context found.

N. Quinn and M. Breur. A force directed component placement procedure for printed circuit boards. IEEE Transactions on Circuits and Systems, CAS-26(6):377--388, 1979.

No context found.

Quinn, N. and Breur M., "A force directed component placement procedure for printed circuit boards", IEEE Trans on Circuits and Systems, 1979, CAS-26, (6), 377-388

No context found.

N.R. Quinn, M. A. Breuer, "A force directed component placement procedure for printed circuit boards", IEEE Trans. Circuits and Systems, pp. 377-388, June 1979.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC