Separating Colored Points

Please enable javascript in your browser.

Assadian, Navid | 2014

693 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 46355 (02)
University: Sharif University of Technology
Department: Mathematical Sciences
Advisor(s): Zarei, Alireza
Abstract:
Separating colored points is one of the important problems in computational geometry. In separating colored points problems a set of colored points in Euclidean space are given that each color designates a set of certain data.Different problems can be defined in the colored points subject. Among them,separating colored points is studied in this thesis. It is supposed that two sets of blue and red points are given. It is desired to find the minimum number of rectangles that separate the blue points from the red points. It is demonstrated hat if P ̸= NP then there is no polynomial time algorithm for solving this problem. Then, a constant factor approximation algorithm is introduced and applied to a special case
Keywords:
Computational Geometry ; Approximate Algorithm ; Separability ; Colored Points