scientific article; zbMATH DE number 1875422

From MaRDI portal
Publication:4796181

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.



Related Items (36)

Efficiently approximating color-spanning ballsOn the \(k\)-colored rainbow sets in fixed dimensionsOn some geometric problems of color-spanning setsThe approximation algorithms for a class of multiple-choice problemAn Approximation Algorithm for the Smallest Color-Spanning Circle ProblemMinimum color spanning circle of imprecise pointsColor spanning objects: algorithms and hardness resultsAlgorithms for interval structures with applicationsFréchet Distance for Uncertain CurvesOnline \(k\)-color spanning disk problemsShortest color-spanning intervalsArbitrary-oriented color spanning region for line segmentsComputing minimum diameter color-spanning sets is hardThe bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\)Colored spanning graphs for set visualizationFarthest-polygon Voronoi diagramsMinimum color spanning circle in imprecise setupThe weighted farthest color Voronoi diagram on trees and graphs.On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning ModelStabbing segments with rectilinear objectsAlgorithms for Interval Structures with ApplicationsComputing the Fréchet distance between uncertain curves in one dimensionStabbing circles for sets of segments in the planeMinimum width color spanning annulusColor-spanning localized queryComputing the Fréchet distance between uncertain curves in one dimensionBichromatic 2-center of pairs of pointsComputing the center region and its variantsColor Spanning Objects: Algorithms and Hardness ResultsA randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clustersMinimum Width Color Spanning AnnulusUnnamed ItemOn some matching problems under the color-spanning modelClustering Geometrically-Modeled Points in the Aggregated Uncertainty ModelExpected computations on color spanning setsRandomized incremental construction for the Hausdorff Voronoi diagram revisited and extended




This page was built for publication: