Smallest Color-Spanning Objects

Authors:
Manuel Abellanas;Ferrán Hurtado;Christian Icking;Rolf Klein;Elmar Langetepe;Lihong Ma;Belén Palop;Vera Sacristan
Affiliations:
-;-;-;-;-;-;-;-
Venue:
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Year:
2001

Citing 12
Cited 8

Computational geometry: an introduction

Computational geometry: an introduction
Finding k points with minimum diameter and related problems

Journal of Algorithms
Euclidean minimum spanning trees and bichromatic closest pairs

Discrete & Computational Geometry
Finding minimum area k-gons

Discrete & Computational Geometry
On geometric optimization with few violated constraints

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computing the smallest k-enclosing circle and related problems

Computational Geometry: Theory and Applications
On enclosing k points by a circle

Information Processing Letters
On a class of O(n2) problems in computational geometry

Computational Geometry: Theory and Applications
Static and dynamic algorithms for k-point clustering problems

Journal of Algorithms
Davenport-Schinzel sequences and their geometric applications

Davenport-Schinzel sequences and their geometric applications
Enclosing k points in the smallest axis parallel rectangle

Information Processing Letters
Chromatic nearest neighbor searching: a query sensitive approach

Computational Geometry: Theory and Applications

Computing minimum diameter color-spanning sets

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Farthest-polygon Voronoi diagrams

Computational Geometry: Theory and Applications
NP-completeness of spreading colored points

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Algorithms for interval structures with applications

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Computing minimum diameter color-spanning sets is hard

Information Processing Letters
Recognition of minimum width color-spanning corridor and minimum area color-spanning rectangle

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
On some geometric problems of color-spanning sets

Journal of Combinatorial Optimization
Algorithms for interval structures with applications

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.