Computing the Smallest Color-Spanning Axis-Parallel Square

DOI10.1007/978-3-642-45030-3_59zbMath1406.68120OpenAlexW2192198619MaRDI QIDQ2872128

Mohammad Ali Abam, Ali Mohades, Mohammad Reza Kazemi, Payam Khanteimouri

Publication date: 14 January 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45030-3_59

zbMATH Keywords

algorithmcomputational geometrycolor-spanning objects

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (12)

Efficiently approximating color-spanning balls ⋮ Minimum color spanning circle of imprecise points ⋮ Color spanning objects: algorithms and hardness results ⋮ Online \(k\)-color spanning disk problems ⋮ Shortest color-spanning intervals ⋮ Arbitrary-oriented color spanning region for line segments ⋮ Minimum color spanning circle in imprecise setup ⋮ Minimum width color spanning annulus ⋮ Color-spanning localized query ⋮ Computing the center region and its variants ⋮ Color Spanning Objects: Algorithms and Hardness Results ⋮ Unnamed Item

This page was built for publication: Computing the Smallest Color-Spanning Axis-Parallel Square