Optimum partitioning of rectilinear layouts
โ Scribed by Nguyen, V.H.
- Book ID
- 114448258
- Publisher
- The Institution of Electrical Engineers
- Year
- 1996
- Tongue
- English
- Weight
- 414 KB
- Volume
- 143
- Category
- Article
- ISSN
- 1350-2387
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A minimum k-partition decomposes a rectilinear polygon with n vertices into a minimum number of disjoint rectilinear components with no more than k vertices each (k < n). First, we derive a new lower bound for the number of components in a kpartition. Then we present algorithms to compute minimum k-
The forward rectilinear motion of a system of two rigid bodies along a horizontal plane is considered. Forces of dry friction act between the bodies and the plane, and the motion is controlled by internal forces of interaction between the bodies. A periodic motion in which the system moves along a s