Fast algorithms for direct enclosures and direct dominances
From MaRDI portal
Publication:3833616
DOI10.1016/0196-6774(89)90011-4zbMath0677.68042OpenAlexW2072915958MaRDI QIDQ3833616
Otto Nurmi, Thomas Ottmann, Ralf Hartmut Gueting
Publication date: 1989
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(89)90011-4
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99) Algorithms in computer science (68W99)
Related Items
Computing rectangle enclosures ⋮ On building the transitive reduction of a two-dimensional poset ⋮ A parallel algorithm to construct a dominance graph on nonoverlapping rectangles ⋮ An efficient algorithm for computing the maximum empty rectangle in three dimensions ⋮ Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles ⋮ Confluent Hasse Diagrams ⋮ Persistent homology in \(\ell_\infty\) metric