|
Descripción
|
|
|---|---|
| This CRP focuses on combinatorial properties of discrete sets of points and other simple geometric objects primarily in the plane. In general, geometric graphs are a central topic in discrete and computational geometry, and many important questions in mathematics and computer science can be formulated as problems on geometric graphs. In the current context, several families of geometric graphs, such as proximity and skeletal structures, constitute useful abstractions for the study of combinatorial properties of the point sets on which they are defined. For arrangements of other objects, such as lines or convex sets, their combinatorial properties are usually also described via an underlying graph structure. ComPoSe consists of the following individual projects. IP01 Erd?s-Szekeres type problems for colored point sets and compatible graphs (Austria) IP02 Coloring Arrangements of Geometric Objects (Belgium) IP03 Arrangements and Higher Dimensions (Germany) IP04 Point sets and graphs: geometric bridges (Spain) IP05 Structural Properties of Arrangements of Convex Bodies (Hungary) IP06 Geometric and topological graphs, and Erd?s-type problems (Czech Republic) IP07 Crossing-Free Configurations in the Plane ? Counting, Enumeration, and Sampling (Switzerland) | |
|
Internacional
|
Si |
|
Tipo de proyecto
|
Proyectos y convenios en convocatorias públicas competitivas |
|
Entidad financiadora
|
Ministerio de Cincia e Innovación, European Science Foundation |
|
Nacionalidad Entidad
|
ESPAÑA |
|
Tamaño de la entidad
|
Gran Empresa (>250) |
|
Fecha concesión
|
01/10/2011 |