The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
A forced directed component placement procedure for printed circuit boards
Abstract
This paper deals with the problem of placing components on a carrier, such as a printed circuit board (PCB). We present a new mathematical formulation of the concept of force directed placement, and describe an efficient computational procedure for solving the resulting system of equations. The placement procedure is broken down into two phases, Phase I being the "relative location phase," and Phase II being the "slot assignment or component overlap resolution phase." In Phase I of the procedure, we solve a set of simultaneous equations, based upon the interconnection topology of the system of components, in an endeavor to determine the optimum relative location of every component with respect to every other component. The equations are set up such that there are attractive forces between components sharing a common signal, and repulsive forces between components having no signals in common. The results of Phase I are often unacceptable from a physical standpoint because there is a great deal of overlap among the components. Phase II eliminates component overlap by either of two methods, depending upon the physical properties of the carrier. If the carrier is subdivided into slots, then the components are assigned to these slots using a criteria which minimiZes the total distance that all components need be moved. We perform this assignment by using the linear assignment algorithm. If the carrier is such that components are allowed to reside anywhere, then a different technique to resolve component overlap is used. A parametric analysis of the procedure is given based upon 12 different PCB's. These results show comparisons of this method to the work of others, and provide some insight into the method's absolute merits.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Algorithms for the Assignment and Transportation Problems
Munkres, J. (1957) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0105003 · Cited by 3,986
An r-Dimensional Quadratic Placement Algorithm
Hall, K. M. (1970) · Management Science · doi:10.1287/mnsc.17.3.219 · Cited by 522
An extension of the Munkres algorithm for the assignment problem to rectangular matrices
Bourgeois, F., & Lassalle, J.-C. (1971) · Communications of the ACM · doi:10.1145/362919.362945 · Cited by 501
The Backboard Wiring Problem: A Placement Algorithm
Steinberg, L. (1961) · SIAM Review · doi:10.1137/1003003 · Cited by 379
Ross, G. J. (1963) · Rothamsted Repository (Rothamsted Repository) · Cited by 44
Introduction to Numerical Methods
Gatti, F., Lasorne, B., Meyer, H., & Nauts, A. (2017) · Lecture notes in chemistry · doi:10.1007/978-3-319-53923-2_8 · Cited by 13
Cited by
Graph drawing by force‐directed placement
Fruchterman, T. M. J., & Reingold, E. M. (1991) · Software: Practice and Experience · doi:10.1002/spe.4380211102 · Cited by 6,352
A Procedure for Placement of Standard-Cell VLSI Circuits
Dunlop, A. E., & Kernighan, B. W. (1985) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.1985.1270101 · Cited by 505
VLSI cell placement techniques
Shahookar, K., & Mazumder, P. (1991) · ACM Computing Surveys · doi:10.1145/103724.103725 · Cited by 308
Metadata
- Authors
- Quinn, N., & Breuer, M.
- Venue
- IEEE Transactions on Circuits and Systems
- Published
- 1979-06
- Volume
- 26
- Issue
- 6
- Pages
- 377-388
- ISSN
- 0098-4094 (ISSN-L)
- OpenAlex
- W2066495677
- Cited by
- 263
- References
- 6
- FWCI
- 1.17
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A forced directed component placement procedure for printed circuit boards. https://app.cochat.ai/papers/10.1109/tcs.1979.1084652
- The paper
- Quinn, N., & Breuer, M. (1979). A forced directed component placement procedure for printed circuit boards. IEEE Transactions on Circuits and Systems. https://doi.org/10.1109/tcs.1979.1084652
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.