๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Minimum K-partitioning of rectilinear po
โœ Oliver Gunther ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 941 KB

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 optimum rectilinear motion of a two-
โœ F.L. Chernous'ko ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 560 KB

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