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

algorithmsconnected componentsdesignoptimalVLSIcomputational geometrydecomposition of a set of polygonsintersecting polygons

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20) Discrete mathematics in relation to computer science (68R99)

Related Items (1)

A decompositin theorem for convexity spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic C-oriented polygonal intersection searching
• Rectilinear line segment intersection, layered segment trees, and dynamization
• The measure problem for rectangular ranges in d-space
• Plane-sweep algorithms for intersecting geometric figures

This page was built for publication: On some union and intersection problems for polygons with fixed orientations