The space-optimal version of a known rectangle enclosure reporting algorithm

DOI10.1016/S0020-0190(96)00186-XzbMath0925.68194OpenAlexW2060682229MaRDI QIDQ1391959

Panayiotis Bozanis, Christos Makris, Nectarios Kitsios, Athanasios K. Tsakalidis

Publication date: 23 July 1998

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00186-x

zbMATH Keywords

Computational geometryPersistenceDominanceRectangle enclosure

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (3)

Optimal algorithms for some polygon enclosure problems for VLSI layout analysis ⋮ Some Results for Elementary Operations ⋮ A new algorithm for rectangle enclosure reporting

Cites Work

• Making data structures persistent
• Space reduction and an extension for a hidden line elimination algorithm
• On the equivalence of some rectangle problems
• Preserving order in a forest in less than logarithmic time and linear space
• An improved algorithm for the rectangle enclosure problem
• Design and implementation of an efficient priority queue
• The Rectangle Enclosure and Point-Dominance Problems Revisited

This page was built for publication: The space-optimal version of a known rectangle enclosure reporting algorithm