SMALLEST COLOR-SPANNING OBJECT REVISITED

DOI10.1142/S0218195909003076zbMath1178.65020MaRDI QIDQ3647618

Partha P. Goswami, Sandip Das, Subhas C. Nandy

Publication date: 23 November 2009

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

complexityalgorithmgeometric dualitycorridorsmallest color-spanning object

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (18)

On some geometric problems of color-spanning sets ⋮ 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 ⋮ Minimum color spanning circle in imprecise setup ⋮ Stabbing segments with rectilinear objects ⋮ On Some Geometric Problems of Color-Spanning Sets ⋮ Algorithms for Interval Structures with Applications ⋮ Minimum width color spanning annulus ⋮ Color-spanning localized query ⋮ Color Spanning Objects: Algorithms and Hardness Results ⋮ Minimum Width Color Spanning Annulus ⋮ Unnamed Item ⋮ Expected computations on color spanning sets

Cites Work

• Unnamed Item
• Finding the upper envelope of n line segments in O(n log n) time
• Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation
• On \(k\)-sets in arrangements of curves and surfaces
• The upper envelope of Voronoi surfaces and its applications
• The K-dense corridor problems
• Constructing Belts in Two-Dimensional Arrangements with Applications
• Dynamically maintaining the widest \(k\)-dense corridor

This page was built for publication: SMALLEST COLOR-SPANNING OBJECT REVISITED