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

Authors:
Subhashis Majumder;Subhas C. Nandy;Bhargab B. Bhattacharya
Affiliations:
Department of Computer Science and Engineering Heritage Institute of Technology Kolkata 700 107, India. E-mail: subhashis.majumder@heritageit.edu;ACM Unit Indian Statistical Institute Kolkata 700 108, India. E-mail: {nandysc,bhargab}@isical.ac.in;ACM Unit Indian Statistical Institute Kolkata 700 108, India. E-mail: {nandysc,bhargab}@isical.ac.in
Venue:
Fundamenta Informaticae
Year:
2010

Citing 8
Cited 0

A strongly polynomial algorithm to solve combinatorial linear programs

Operations Research
Approximation algorithms for hitting objects with straight lines

Discrete Applied Mathematics
Intersection number of two connected geometric graphs

Information Processing Letters
Multi-sensor fusion: fundamentals and applications with software

Multi-sensor fusion: fundamentals and applications with software
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem

Journal of Algorithms
On a Minimum Linear Classification Problem

Journal of Global Optimization
On plane spanning trees and cycles of multicolored point sets with few intersections

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we deal with the problem of partitioning a set of coplanar points of more than one colors into monochromatic cells using minimum number of axis-parallel straight lines. It is first shown that the problem is NP-hard. A fast heuristic is then presented to solve this problem. Experimental results on randomly generated instances indicate that the proposed method is much faster than the existing techniques, with minor degradation in the cost of the partition.