Separating multi-color points on a plane with fewest axis-parallel lines

DOI10.3233/FI-2010-251MaRDI QIDQ4932067zbMATH OpenOpenAlexFDO

Authors Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya

Publication date 1 October 2010

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2010-251

zbMATH Keywords

heuristicNP-hardnessvertex covermonochromatic partitioning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• SEPARATING POINTS BY AXIS-PARALLEL LINES
• On a minimum linear classification problem
• PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS
• scientific article; zbMATH DE number 1830740
• On the parameterized complexity of red-blue points separation

Cited in

(4)

• Diverse partitions of colored points
• On a minimum linear classification problem
• SEPARATING POINTS BY AXIS-PARALLEL LINES
• Computing the coarseness with strips or boxes

This page was built for publication: Separating multi-color points on a plane with fewest axis-parallel lines

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