An improved algorithm for the rectangle enclosure problem
From MaRDI portal
Publication:3956420
DOI10.1016/0196-6774(82)90021-9zbMath0493.68072MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68R99: Discrete mathematics in relation to computer science
68W99: Algorithms in computer science
Related Items
Computing a poset from its realizer, In-place algorithms for computing a largest clique in geometric intersection graphs, Optimal algorithms for some polygon enclosure problems for VLSI layout analysis, Interval graphs and related topics, Geometric containment and vector dominance, The expected size of some graphs in computational geometry, The space-optimal version of a known rectangle enclosure reporting algorithm, A new algorithm for rectangle enclosure reporting, A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids, Computing rectangle enclosures, An optimal time and minimal space algorithm for rectangle intersection problems, Some Results for Elementary Operations, Divide-and-conquer in planar geometry, Direct dominance of points