Optimal algorithms for solving problems of arrangement and covering of plane polygonal figures

DOI10.1090/TRANS2/142/02zbMath0674.68038OpenAlexW4242333505MaRDI QIDQ3829076

E. B. Rabinovich, Valeriĭ Zalmanovich Feĭnberg, L. V. Nosov, E. G. Nosova

Publication date: 1989

Published in: American Mathematical Society Translations: Series 2 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/trans2/142/02

zbMATH Keywords

trapezoidsrectanglesintegrated circuit design

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Polyhedra and polytopes; regular figures, division of spaces (51M20) Applications of design theory to circuits and networks (94C30) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

This page was built for publication: Optimal algorithms for solving problems of arrangement and covering of plane polygonal figures