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

DOI10.1016/0196-6774(84)90027-0zbMATH Open0546.68050OpenAlexW1986115637MaRDI QIDQ3336711FDOQ3336711

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

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

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)

Cited In (14)

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

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)