Optimal algorithms to compute the closure of a set of iso-rectangles

DOI10.1016/0196-6774(84)90027-0zbMath0546.68050OpenAlexW1986115637MaRDI QIDQ3336711

Eljas Soisalon-Soininen, Derick Wood

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)90027-0

zbMATH Keywords

safetydeadlocksdatabase concurrency controlclosure of a set of iso-rectangleslocked transaction systemsrectilinearly-oriented rectanglestime and space optimal algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information storage and retrieval of data (68P20) Discrete mathematics in relation to computer science (68R99)

Related Items (14)

Partitioning and separating sets of orthogonal polygons ⋮ PLANAR STRONG VISIBILITY ⋮ Sweep methods for parallel computational geometry ⋮ Fundamentals of restricted-orientation convexity ⋮ Visibility in semi-convex spaces ⋮ On the power of safe locking ⋮ Divide-and-conquer in planar geometry ⋮ Deadlock-freedom (and safety) of transactions in a distributed database ⋮ Generalized halfspaces in restricted-orientation convexity ⋮ Optimization on directionally convex sets ⋮ A decompositin theorem for convexity spaces ⋮ Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles ⋮ Interval graphs and related topics ⋮ Fast dynamic intersection searching in a set of isothetic line segments

This page was built for publication: Optimal algorithms to compute the closure of a set of iso-rectangles