Smallest color-spanning objects

DOI10.1007/3-540-44676-1_23MaRDI QIDQ4796181zbMATH OpenFDO

Authors Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Vera Sacristán, Belén Palop, Lihong Ma

Publication date 2 March 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2161/21610278

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• SMALLEST COLOR-SPANNING OBJECT REVISITED
• Computing the smallest color-spanning axis-parallel square
• On some geometric problems of color-spanning sets
• Color spanning objects: algorithms and hardness results
• Color-spanning localized query

Cited in

(42)

• The weighted farthest color Voronoi diagram on trees and graphs.
• Colored spanning graphs for set visualization
• Stabbing circles for sets of segments in the plane
• Minimum width color spanning annulus
• Computing minimum diameter color-spanning sets is hard
• Color-spanning localized query
• On the \(k\)-colored rainbow sets in fixed dimensions
• Minimum color spanning circle of imprecise points
• Color spanning objects: algorithms and hardness results
• Bichromatic 2-center of pairs of points
• On some matching problems under the color-spanning model
• Expected computations on color spanning sets
• On some geometric problems of color-spanning sets
• Minimum color spanning circle in imprecise setup
• Color spanning objects: algorithms and hardness results
• Minimum width color spanning annulus
• Efficiently approximating color-spanning balls
• Computing the smallest color-spanning axis-parallel square
• Algorithms for interval structures with applications
• An Approximation Algorithm for the Smallest Color-Spanning Circle Problem
• The approximation algorithms for a class of multiple-choice problem
• SMALLEST COLOR-SPANNING OBJECT REVISITED
• Algorithms for interval structures with applications
• The bottleneck 2-connected k-Steiner network problem for k 2
• On the fixed-parameter tractability of some matching problems under the color-spanning model
• Network optimization on partitioned pairs of points
• Clustering geometrically-modeled points in the aggregated uncertainty model
• Computing the Fréchet distance between uncertain curves in one dimension
• Computing the Fréchet distance between uncertain curves in one dimension
• Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended
• Fréchet Distance for Uncertain Curves
• Online \(k\)-color spanning disk problems
• Arbitrary-oriented color spanning region for line segments
• Farthest-polygon Voronoi diagrams
• Computing largest minimum color-spanning intervals of imprecise points
• Maximum-width rainbow-bisecting empty annulus
• The 2-mixed-center color spanning problem
• Unbounded regions of high-order Voronoi diagrams of lines and line segments in higher dimensions
• Fréchet distance for uncertain curves
• Colored points traveling salesman problem
• Deterministic 3SUM-hardness
• Shortest color-spanning intervals

This page was built for publication: Smallest color-spanning objects

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