Smallest Color-Spanning Objects

12 years 6 months ago

Download www-ma2.upc.es

Motivated by questions in location planning, we show for a set of colored point sites in the plane how to compute the smallest— by perimeter or area—axis-parallel rectangle and the narrowest strip enclosing at least one site of each color.

Manuel Abellanas, Ferran Hurtado, Christian Icking

Real-time Traffic

Algorithms | Area—axis-parallel Rectangle | ESA 2001 | Location Planning | Narrowest Strip |

claim paper

Related Content

» A Radio Coloring of a Hypercube

» The List Update Problem Improved Bounds for the Counter Scheme

» Optimal Robust Stabilization and Dissipativity Synthesis by Behavioral Interconnection

» Reversible Watermarking by Modulation and Security Enhancement

» An optimal polygonal boundary encoding scheme in the rate distortion sense

» Minimizing the object dimensions in circle and sphere packing problems

» Lasserre Hierarchy Higher Eigenvalues and Approximation Schemes for Quadratic Integer Prog...

» An Efficient Algorithm for Computing Hypervolume Contributions

» A Note on the Distance to Monotonicity of Boolean Functions

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	ESA
Authors	Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, Belén Palop, Vera Sacristan

Comments (0)

Sciweavers

Smallest Color-Spanning Objects

Algorithms | Area—axis-parallel Rectangle | ESA 2001 | Location Planning | Narrowest Strip |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers