Enclosing many boxes by an optimal pair of boxes

DOI10.1007/3-540-55210-3_206zbMath1494.68268OpenAlexW1575098190MaRDI QIDQ5096804

Thomas Ohler, Gerald Thiemt, Bruno Becker, Stephan Gschwind, Paolo Giulio Franciosa, Peter Widmayer

Publication date: 18 August 2022

Published in: STACS 92 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55210-3_206

zbMATH Keywords

computational geometry

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (2)

Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares ⋮ On R-trees with low query complexity

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Enclosing many boxes by an optimal pair of boxes