Computing the smallest color-spanning axis-parallel square

DOI10.1007/978-3-642-45030-3_59MaRDI QIDQ2872128zbMATH OpenOpenAlexFDO

Authors Payam Khanteimouri, Ali Mohades, Mohammad A. Abam, M. R. Kazemi

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)

Recommendations

• SMALLEST COLOR-SPANNING OBJECT REVISITED
• Color-spanning localized query
• scientific article; zbMATH DE number 1875422
• Localized query: color spanning variations
• On some geometric problems of color-spanning sets

Cited in

(17)

• Color-spanning localized query
• Efficiently approximating color-spanning balls
• scientific article; zbMATH DE number 1875422 (Why is no real title available?)
• Online \(k\)-color spanning disk problems
• Color spanning objects: algorithms and hardness results
• Minimum width color spanning annulus
• Shortest color-spanning intervals
• The 2-mixed-center color spanning problem
• Expected computations on color spanning sets
• Arbitrary-oriented color spanning region for line segments
• Network optimization on partitioned pairs of points
• Minimum color spanning circle of imprecise points
• Expected computations on color spanning sets
• SMALLEST COLOR-SPANNING OBJECT REVISITED
• Color spanning objects: algorithms and hardness results
• Minimum color spanning circle in imprecise setup
• Maximum-width rainbow-bisecting empty annulus

This page was built for publication: Computing the smallest color-spanning axis-parallel square

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