scientific article; zbMATH DE number 1875422

zbMath1006.68559MaRDI QIDQ4796181

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

Publication date: 2 March 2003

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (36)

Efficiently approximating color-spanning balls ⋮ On the \(k\)-colored rainbow sets in fixed dimensions ⋮ On some geometric problems of color-spanning sets ⋮ The approximation algorithms for a class of multiple-choice problem ⋮ An Approximation Algorithm for the Smallest Color-Spanning Circle Problem ⋮ Minimum color spanning circle of imprecise points ⋮ Color spanning objects: algorithms and hardness results ⋮ Algorithms for interval structures with applications ⋮ Fréchet Distance for Uncertain Curves ⋮ Online \(k\)-color spanning disk problems ⋮ Shortest color-spanning intervals ⋮ Arbitrary-oriented color spanning region for line segments ⋮ Computing minimum diameter color-spanning sets is hard ⋮ The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\) ⋮ Colored spanning graphs for set visualization ⋮ Farthest-polygon Voronoi diagrams ⋮ Minimum color spanning circle in imprecise setup ⋮ The weighted farthest color Voronoi diagram on trees and graphs. ⋮ On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model ⋮ Stabbing segments with rectilinear objects ⋮ Algorithms for Interval Structures with Applications ⋮ Computing the Fréchet distance between uncertain curves in one dimension ⋮ Stabbing circles for sets of segments in the plane ⋮ Minimum width color spanning annulus ⋮ Color-spanning localized query ⋮ Computing the Fréchet distance between uncertain curves in one dimension ⋮ Bichromatic 2-center of pairs of points ⋮ Computing the center region and its variants ⋮ Color Spanning Objects: Algorithms and Hardness Results ⋮ A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters ⋮ Minimum Width Color Spanning Annulus ⋮ Unnamed Item ⋮ On some matching problems under the color-spanning model ⋮ Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model ⋮ Expected computations on color spanning sets ⋮ Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended

This page was built for publication: