Fast algorithms for direct enclosures and direct dominances

DOI10.1016/0196-6774(89)90011-4MaRDI QIDQ3833616zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

direct dominance problemdirect enclosure problemdominance problemenclosure problemtriangles

Mathematics Subject Classification ID

Graph theory (05C99) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Recommendations

• The Rectangle Enclosure and Point-Dominance Problems Revisited
• scientific article; zbMATH DE number 1057777
• A general approach to dominance in the plane
• Direct dominance of points
• Computing rectangle enclosures

Cited in

(16)

• A fast algorithm for index of annihilation computations
• Persistent homology in \(\ell_\infty\) metric
• Computing rectangle enclosures
• On building the transitive reduction of a two-dimensional poset
• Pareto envelopes in simple polygons
• Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
• Direct dominance of points
• A general approach to dominance in the plane
• The Rectangle Enclosure and Point-Dominance Problems Revisited
• Fast envelope algorithms
• scientific article; zbMATH DE number 2105040 (Why is no real title available?)
• Deterministic rectangle enclosure and offline dominance reporting on the RAM
• Confluent Hasse Diagrams
• An efficient algorithm for computing the maximum empty rectangle in three dimensions
• Dominance in the presence of obstacles
• A parallel algorithm to construct a dominance graph on nonoverlapping rectangles

This page was built for publication: Fast algorithms for direct enclosures and direct dominances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833616)