An optimal contour algorithm for iso-oriented rectangles

DOI10.1016/0196-6774(84)90013-0zbMath0547.68069OpenAlexW2017167025MaRDI QIDQ3339305

Ralf Hartmut Gueting

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0196-6774(84)90013-0

zbMATH Keywords

computational geometrydata structureiso-oriented rectanglescontour algorithmcontracted segment tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Related Items (6)

Time-and space-optimal contour computation for a set of rectangles ⋮ Sweep methods for parallel computational geometry ⋮ Divide-and-conquer in planar geometry ⋮ Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles ⋮ Interval graphs and related topics ⋮ The contour problem for rectilinear polygons

This page was built for publication: An optimal contour algorithm for iso-oriented rectangles