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

DOI10.1016/S0020-0190(96)00186-XMaRDI QIDQ1391959zbMATH OpenOpenAlexFDO

Authors Panayiotis Bozanis, Nectarios Kitsios, Christos Makris, 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)

Cites work

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

Cited in

(3)

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

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

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