On some union and intersection problems for polygons with fixed orientations

DOI10.1007/BF02240065MaRDI QIDQ1067413zbMATH OpenFDO

Authors B. George

Publication date 1986

Published in Computing (Search for Journal in Brave)

zbMATH Keywords

algorithmsoptimalcomputational geometrydesignconnected componentsVLSIdecomposition of a set of polygonsintersecting polygons

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3825165 (Why is no real title available?)
• scientific article; zbMATH DE number 3958767 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Dynamic C-oriented polygonal intersection searching
• Plane-sweep algorithms for intersecting geometric figures
• Rectilinear line segment intersection, layered segment trees, and dynamization
• The measure problem for rectangular ranges in d-space

Cited in

(1)

• A decompositin theorem for convexity spaces

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

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