Separating Multi-Color Points on a Plane with Fewest Axis-Parallel Lines

DOI10.3233/FI-2010-251zbMath1204.68245OpenAlexW1592690243MaRDI QIDQ4932067

Subhashis Majumder, Subhas C. Nandy, Bhargab Bikram 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

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

Related Items (2)

Diverse partitions of colored points ⋮ 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