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

DOI10.1090/TRANS2/142/02MaRDI QIDQ3829076zbMATH OpenOpenAlexFDO

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

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

integrated circuit designrectanglestrapezoids

Mathematics Subject Classification ID

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

Cited in

(5)

• scientific article; zbMATH DE number 6007896 (Why is no real title available?)
• Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space
• scientific article; zbMATH DE number 4139504 (Why is no real title available?)
• scientific article; zbMATH DE number 3995477 (Why is no real title available?)
• Algorithms of optimal set covering on the planar R^2

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3829076)