An optimal contour algorithm for iso-oriented rectangles
From MaRDI portal
Publication:3339305
DOI10.1016/0196-6774(84)90013-0zbMath0547.68069MaRDI QIDQ3339305
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
computational geometry; data structure; iso-oriented rectangles; contour algorithm; contracted segment tree
68Q25: Analysis of algorithms and problem complexity
68R99: Discrete mathematics in relation to computer science
Related Items
Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles, The contour problem for rectilinear polygons, Interval graphs and related topics, Time-and space-optimal contour computation for a set of rectangles, Sweep methods for parallel computational geometry, Divide-and-conquer in planar geometry