Minimum width color spanning annulus

DOI10.1016/j.tcs.2017.11.031zbMath1390.68701OpenAlexW2773334411MaRDI QIDQ1748988

Sasanka Roy, Ankush Acharyya, Subhas C. Nandy

Publication date: 15 May 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.11.031

zbMATH Keywords

complexityalgorithmslocation planningcolor spanning annulus

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Minimum color spanning circle of imprecise points ⋮ Minimum color spanning circle in imprecise setup

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for interval structures with applications
• An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
• Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
• The upper envelope of Voronoi surfaces and its applications
• On levels in arrangements of lines, segments, planes, and triangles
• Efficient randomized algorithms for some geometric optimization problems
• Computing a Minimum-Width Square Annulus in Arbitrary Orientation
• Minimum Width Color Spanning Annulus
• Computing the Smallest Color-Spanning Axis-Parallel Square
• Minimum Width Rectangular Annulus
• SMALLEST COLOR-SPANNING OBJECT REVISITED

This page was built for publication: Minimum width color spanning annulus