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

DOI10.1016/0196-6774(84)90027-0MaRDI QIDQ3336711zbMATH OpenOpenAlexFDO

Authors Eljas Soisalon-Soininen, D. 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

safetydatabase concurrency controldeadlocksclosure of a set of iso-rectangleslocked transaction systemsrectilinearly-oriented rectanglestime and space optimal algorithms

Mathematics Subject Classification ID

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

Recommendations

• An optimal contour algorithm for iso-oriented rectangles
• Time-and space-optimal contour computation for a set of rectangles
• An optimal time and minimal space algorithm for rectangle intersection problems
• scientific article; zbMATH DE number 176570
• scientific article; zbMATH DE number 3846893

Cited in

(14)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3336711)