The Rectangle Enclosure and Point-Dominance Problems Revisited

DOI10.1142/S0218195997000260MaRDI QIDQ4365026zbMATH OpenOpenAlexFDO

Authors Prosenjit Gupta, Ravi Janardan, Michiel Smid, Bhaskar Dasgupta

Publication date 30 October 1997

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195997000260, https://hdl.handle.net/11858/00-001M-0000-0014-B525-8

zbMATH Keywords

output-sensitive algorithmrectangle enclosurespace sweepvan Emde Boas tree

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Fast algorithms for direct enclosures and direct dominances
• Deterministic rectangle enclosure and offline dominance reporting on the RAM
• Computing rectangle enclosures
• scientific article; zbMATH DE number 2105040

Cited in

(13)

• The space-optimal version of a known rectangle enclosure reporting algorithm
• A new algorithm for rectangle enclosure reporting
• A new combinatorial approach to optimal embeddings of rectangles
• Smallest \(k\)-enclosing rectangle revisited
• Computing rectangle enclosures
• The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions
• Some Results for Elementary Operations
• Fast algorithms for direct enclosures and direct dominances
• A general approach to dominance in the plane
• scientific article; zbMATH DE number 2105040 (Why is no real title available?)
• Deterministic rectangle enclosure and offline dominance reporting on the RAM
• Dominance in the presence of obstacles
• Optimal algorithms for some polygon enclosure problems for VLSI layout analysis

This page was built for publication: The Rectangle Enclosure and Point-Dominance Problems Revisited

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