Time-and space-optimal contour computation for a set of rectangles

DOI10.1016/0020-0190(87)90159-1zbMath0653.68032OpenAlexW2001773778MaRDI QIDQ1108000

Peter Widmayer, Derick Wood

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90159-1

zbMATH Keywords

computational geometryoptimal contour computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other problems of combinatorial convexity (52A37)

Related Items (2)

Sweep methods for parallel computational geometry ⋮ Data filtering based least squares iterative algorithm for parameter identification of output error autoregressive systems

Cites Work

• Unnamed Item
• Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
• The contour problem for rectilinear polygons
• An optimal contour algorithm for iso-oriented rectangles
• Plane-sweep algorithms for intersecting geometric figures
• Finding the contour of a union of iso-oriented rectangies

This page was built for publication: Time-and space-optimal contour computation for a set of rectangles