CEU Electronic Theses and Dissertations, 2009
| Author | Keszegh, Balazs |
|---|---|
| Title | Combinatorial and computational problems about points in the plane |
| Summary | We study three problems in combinatorial geometry. The problems investigated are con flict-free colorings of point sets in the plane with few colors, polychromatic colorings of the vertices of rectangular partitions in the plane and in higher dimensions and polygonalizations of point sets with few refl ex points. These problems are problems of discrete point sets, the proofs are of combinatorial fl avour with computational aspects and give efficient algorithms. First we give a historical introduction to the topics and place our results in this context. We also investigate the similarities between the proving methods of the three topics. |
| Supervisor | Gyori, Ervin; Tardos, Gabor |
| Department | Mathematics PhD |
| Full text | https://www.etd.ceu.edu/2009/tphkeb01.pdf |
Visit the CEU Library.
© 2007-2021, Central European University