Hola,
¿eres nuevo aquí?

Regístrate gratis y conecta tu empresa con financiación pública, partners y proyectos.

Tengo cuenta

Regístrate

Ver video

OPT-GEOM-RS

Financiado

Cerrado

Optimization Problems on Geometric Range Spaces

Computational geometry is a subfield of theoretical computer science devoted to the design and implementation of geometric algorithms, as well as to their analysis, and to the combinatorial structure that they manipulate. In parti... ver más

31/08/2018

TAU

100K€

Presupuesto del proyecto: 100K€

Líder del proyecto

TEL AVIV UNIVERSITY No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Fecha límite participación Sin fecha límite de participación.

Financiación concedida El organismo FP7 notifico la concesión del proyecto el día 2018-08-31 No tenemos la información de la convocatoria

0% 100% 100%

Información adicional privada

No hay información privada compartida para este proyecto. Habla con el coordinador.

1 Participantes

TAU

0.00€ | Lider

Conecta tu I+D

¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video

Proyectos interesantes

A3 Algebraic Algorithms and Applications 100K€ Cerrado

MTM2015-63791-R GRAFOS Y GEOMETRIA: INTERACCIONES Y APLICACIONES 137K€ Cerrado

OptApprox Strong Convex Relaxations with Optimal Approximation Guarant... 1M€ Cerrado

CombiCompGeom Combinatorial Aspects of Computational Geometry 1M€ Cerrado

MTM2011-25816-C02-01 ALGORITMOS Y APLICACIONES EN GEOMETRIA DE CURVAS Y SUPERFICI... 58K€ Cerrado

COCAN Complexity and Condition in Algebra and Numerics 2M€ Cerrado

Líder del proyecto

TEL AVIV UNIVERSITY No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 100K€

Fecha límite de participación Sin fecha límite de participación.

Descripción del proyecto Computational geometry is a subfield of theoretical computer science devoted to the design and implementation of geometric algorithms, as well as to their analysis, and to the combinatorial structure that they manipulate. In particular, computational geometry encompasses a diversity of optimization problems. It is often infeasible in practice to find the optimal solution of a geometric optimization problem. This is because the optimum might typically be hard to compute. This suggests that instead of insisting on computing the exact solution for optimization problems, one should be satisfied with a possibly suboptimal solution that approximates the optimum reasonably well. The goal of this proposal is to consider optimization problems involving geometric objects in low dimensions, and design efficient algorithms that guarantee a good approximation for their solutions. Such problems have been well studied in abstract settings (that is, when the objects are abstract and no geometric properties are known), but their geometric variants have received much less attention, and the solutions to most of these problems have still remained elusive. This project suggests an interdisciplinary challenge. On the theoretical front, it aims to develop a set of mathematical tools taken from discrete geometry, such as geometric arrangements and epsilon nets, which exploit the geometric structure of the given setting. In fact, such tools can be exploited on a broader set of problems, and lie beyond the scope of the problems presented in this proposal. On the applied front, this problems have applications to other disciplines as sensor networking, computer graphics, geographic information systems, machine learning and more. In fact, the PI is collaborating with researchers from sensor networking and learning where she applies such mathematical tools in order to solve problems from the real world.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores