On some union and intersection problems for polygons with fixed orientations

DOI10.1007/BF02240065zbMath0579.68044MaRDI QIDQ1067413

B. George

Publication date: 1986

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

algorithms; connected components; design; optimal; VLSI; computational geometry; decomposition of a set of polygons; intersecting polygons

Mathematics Subject Classification ID

51M20: Polyhedra and polytopes; regular figures, division of spaces

68R99: Discrete mathematics in relation to computer science