The contour problem for rectilinear polygons

DOI10.1016/0020-0190(84)90058-9zbMath0558.68059OpenAlexW2005465277MaRDI QIDQ802313

Derick Wood

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90058-9

zbMATH Keywords

optimal algorithmorthogonal polygonsrectanglessegment treecontour problemdisjoint-set unionscan linesweep plane

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Related Items (2)

Time-and space-optimal contour computation for a set of rectangles ⋮ Sweep methods for parallel computational geometry

Cites Work

• Unnamed Item
• Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
• On the X-Y convex hull of a set of X-Y polygons
• An optimal contour algorithm for iso-oriented rectangles
• Finding the contour of a union of iso-oriented rectangies

This page was built for publication: The contour problem for rectilinear polygons