An Approximation Algorithm for the Smallest Color-Spanning Circle Problem

DOI10.1007/978-3-319-21398-9_14zbMath1465.68310OpenAlexW1166089385MaRDI QIDQ3196382

Yin Wang, Yin-Feng Xu

Publication date: 29 October 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-21398-9_14

zbMATH Keywords

approximation algorithmcomputational geometrycolored setminimum diameter color-spanning set problem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Fast computation of smallest enclosing circle with center on a query line segment
• Euclidean minimum spanning trees and bichromatic closest pairs
• Finding minimum area \(k\)-gons
• Iterated nearest neighbors and finding minimal polytopes
• On some geometric problems of color-spanning sets
• Computing Minimum Diameter Color-Spanning Sets
• Sets with No Empty Convex 7-Gons

This page was built for publication: An Approximation Algorithm for the Smallest Color-Spanning Circle Problem