Finding the contour of a union of iso-oriented rectangies

DOI10.1016/0196-6774(80)90011-5zbMath0456.68079OpenAlexW2068772835MaRDI QIDQ5904701

Franco P. Preparata, Witold jun. Lipski

Publication date: 1980

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(80)90011-5

zbMATH Keywords

computational geometryoptimal algorithmssegment trees

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Related Items (3)

Time-and space-optimal contour computation for a set of rectangles ⋮ Parallel computational geometry of rectangles ⋮ The contour problem for rectilinear polygons

This page was built for publication: Finding the contour of a union of iso-oriented rectangies