Theory and Applications of Point Configurations and Graphs
Total activity: 1
Type of activity
AGENCIA ESTATAL DE INVESTIGACION
Funding entity code
The project focuses on the understanding of combinatorial and geometric properties of point sets and graphs, and the algorithmic questions around them. Point configurations and graphs constitute important objects of study in discrete mathematics and theoretical computer science. The project is mainly of theoretical nature, but with a strong emphasis on the interdisciplinary applications of geometric and combinatorial techniques. The proposal is supported by a research team formed by thirteen experienced researchers, representing a large part of the Computational Geometry community in Spain, building upon the strong success of previous projects, and levering the expertise of one of the strongest Computational Geometry communities in Europe. The topics of the project cover a wide variety of aspects about point configurations and graphs, both in a geometric and in an abstract setting, with the main focus on their combinatorial and algorithmic properties. Most objects studied in this project will be thus embedded in the Euclidean plane or space, but problems on combinatorial graphs and their relation to their geometric counterparts will be also considered. The project is organized into eight work packages, four of them of applied nature, three of a more basic nature, and one for dissemination and transfer. The applied packages concern different levels of applicability (or technology readiness level) of geometric techniques to various application domains: robotics, geographic information, networking, and sensory analysis. While some applied packages are more fundamental, consisting of an algorithmic study of an important applied problem, some others deal with new technologies that have been already prototyped in an industrial setting. The theoretical work packages address combinatorial and algorithmic properties of point sets, geometric networks, and the understanding of a number of graph problems related to location, domination, and several related problems on graph labelings. Finally, we include a package devoted to the dissemination and transfer plans of the project.
Corujo, J.; Flores, D.; Huemer, C.; Seara, C.; Perez-Lantero, P. International Workshop on Algorithms and Computation p. 261-272 DOI: 10.1007/978-3-030-39881-1\_22 Presentation's date: 2020 Presentation of work at congresses