Expected computations on color spanning sets

DOI10.1007/978-3-642-38756-2_15MaRDI QIDQ5405923zbMATH OpenOpenAlexFDO

Authors Chenglin Fan, Jun Luo, Farong Zhong, Binhai Zhu

Publication date 3 April 2014

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-38756-2_15

zbMATH Keywords

computational geometryexpected valueimprecise data

Mathematics Subject Classification ID

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

Recommendations

• Expected computations on color spanning sets
• On some geometric problems of color-spanning sets
• On some geometric problems of color-spanning sets
• Computing the smallest color-spanning axis-parallel square
• The approximation algorithms for a class of multiple-choice problem

Cited in

(1)

• Expected computations on color spanning sets

This page was built for publication: Expected computations on color spanning sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405923)