K-Strong Conflict Free Coloring of Regions with Respect to a Family of Points, M.Sc. Thesis Sharif University of Technology ; Abam, Mohammad Ali (Supervisor)
Abstract
The conflict-free coloring is one of the computational geometry problems that has received attention in the last two decades. The root of this problem comes from the frequency allocation problem to telecommunications antennas, where we have several telecommunication antennas in two-dimensional space aiming to assign to each of them a frequency so that every point on the plane, which is at least inside one of the antenna ranges, stays in a range with a frequency different from the other antennas containing point.One of the generalizations of this problem is the k-strong case, where we have n regions (equivalent to the circular region of the antennas) that we want to color so that for each...
Cataloging briefK-Strong Conflict Free Coloring of Regions with Respect to a Family of Points, M.Sc. Thesis Sharif University of Technology ; Abam, Mohammad Ali (Supervisor)
Abstract
The conflict-free coloring is one of the computational geometry problems that has received attention in the last two decades. The root of this problem comes from the frequency allocation problem to telecommunications antennas, where we have several telecommunication antennas in two-dimensional space aiming to assign to each of them a frequency so that every point on the plane, which is at least inside one of the antenna ranges, stays in a range with a frequency different from the other antennas containing point.One of the generalizations of this problem is the k-strong case, where we have n regions (equivalent to the circular region of the antennas) that we want to color so that for each...
Find in contentBookmark |
|