Optimal algorithms to compute the closure of a set of iso-rectangles☆
References (8)
- et al.
A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems
J. Algorithms
(1981) - et al.
The Design and Analysis of Computer Algorithms
(1974) - et al.
Algorithms for reporting and counting geometric intersections
IEEE Transactions on Computers
(1979) - et al.
The notions of consistency and predicate locks in a database system
Communications of the ACM
(1976)
There are more references available in the full text version of this article.
Cited by (24)
Enclosing a Set of Objects by Two Minimum Area Rectangles
1996, Journal of AlgorithmsFundamentals of restricted-orientation convexity
1996, Information SciencesOn the power of safe locking
1990, Journal of Computer and System SciencesOrtho-Convexity and its Generalizations
1988, Machine Intelligence and Pattern RecognitionPartitioning and separating sets of orthogonal polygons
1987, Information SciencesDynamic orthogonal segment intersection search
1987, Journal of Algorithms
- ☆
The work of the second author was partially supported by a Natural Sciences and Engineering Research Council of Canada Grant A-7700 and was carried out while visiting the University of Helsinki. Some of the work of the first author was conducted while visiting the University of Karlsruhe under the support of the Alexander von Humboldt Foundation. Some of the results were also presented in preliminary form at the ACM SIGACT-SIGMOD Conference on Principles of Database Systems, Los Angeles, March 1982.
Copyright © 1984 Published by Elsevier Inc.