On Some Geometric Problems of Color-Spanning Sets

DOI10.1007/978-3-642-21204-8_15zbMath1329.68263OpenAlexW2288181658MaRDI QIDQ3004661

Jun Luo, Chenglin Fan, Wenqi Ju, Binhai Zhu

Publication date: 3 June 2011

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21204-8_15

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Computing minimum diameter color-spanning sets is hard

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Average case analysis of dynamic geometric optimization
• Computing Minimum Diameter Color-Spanning Sets
• SMALLEST COLOR-SPANNING OBJECT REVISITED

This page was built for publication: On Some Geometric Problems of Color-Spanning Sets