An improved algorithm for the rectangle enclosure problem
From MaRDI portal
Publication:3956420
DOI10.1016/0196-6774(82)90021-9zbMath0493.68072OpenAlexW2015485420MaRDI QIDQ3956420
No author found.
Publication date: 1982
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(82)90021-9
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)
Related Items
Computing rectangle enclosures ⋮ Computing a poset from its realizer ⋮ Geometric containment and vector dominance ⋮ A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids ⋮ The expected size of some graphs in computational geometry ⋮ Optimal algorithms for some polygon enclosure problems for VLSI layout analysis ⋮ The space-optimal version of a known rectangle enclosure reporting algorithm ⋮ Divide-and-conquer in planar geometry ⋮ Direct dominance of points ⋮ An optimal time and minimal space algorithm for rectangle intersection problems ⋮ In-place algorithms for computing a largest clique in geometric intersection graphs ⋮ Some Results for Elementary Operations ⋮ Interval graphs and related topics ⋮ A new algorithm for rectangle enclosure reporting
This page was built for publication: An improved algorithm for the rectangle enclosure problem
