A new algorithm for rectangle enclosure reporting

DOI10.1016/S0020-0190(99)00145-3zbMATH Open0999.68222OpenAlexW2045826738MaRDI QIDQ1607019FDOQ1607019

Authors: George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis 

Publication date: 25 July 2002

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00145-3

Recommendations

• scientific article; zbMATH DE number 2105040
• The Rectangle Enclosure and Point-Dominance Problems Revisited
• An optimal time and minimal space algorithm for rectangle intersection problems
• Computing rectangle enclosures
• A new algorithm for the largest empty rectangle problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Preserving order in a forest in less than logarithmic time and linear space
• Scanline algorithms on a grid
• An improved algorithm for the rectangle enclosure problem
• Design and implementation of an efficient priority queue
• On the equivalence of some rectangle problems
• The space-optimal version of a known rectangle enclosure reporting algorithm
• The Rectangle Enclosure and Point-Dominance Problems Revisited

Cited In (3)

• Some Results for Elementary Operations
• Computing rectangle enclosures
• Title not available (Why is that?)

This page was built for publication: A new algorithm for rectangle enclosure reporting

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