The research group on Computational Geometry and Applications (CGA) is devoted to carrying out research on computational geometry with a strong emphasis in applications. Computational geometry is an active field in the interface between applied mathematics and computer science that studies algorithmic problems involving discrete geometric objects. The field has applications in robotics, computer graphics, CAD/CAM, integrated circuit design, computer vision, and geographic information science.

The CGA group has the goal of working not only on the design of efficient algorithms, but also on their application to different domains. In particular, we will concentrate on making progress on core geometric problems, and on their applications to two concrete domains: robotics and geographic information science.

http://futur.upc.edu/CGA

Enviaments recents

  • Non-crossing paths with geographic constraints 

    Silveira, Rodrigo Ignacio; Speckmann, Bettina; Verbeek, Kevin (Springer, 2018)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    A geographic network is a graph whose vertices are restricted to lie in a prescribed region in the plane. In this paper we begin to study the following fundamental problem for geographic networks: can a given geographic ...
  • On the complexity of barrier resilience for fat regions and bounded ply 

    Korman, Matias; Löffler, Maarten; Silveira, Rodrigo Ignacio; Strash, Darren (2018-06)
    Article
    Accés restringit per política de l'editorial
    In the barrier resilience problem (introduced by Kumar et al., Wireless Networks 2007), we are given a collection of regions of the plane, acting as obstacles, and we would like to remove the minimum number of regions so ...
  • Colored ray configurations 

    Fabila Monroy, Ruy; Garcia Olaverri, Alfredo Martin; Hurtado Díaz, Fernando Alfredo; Jaume, Rafel; Pérez Lantero, Pablo; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Urrutia Galicia, Jorge (2018-05)
    Article
    Accés restringit per política de l'editorial
    We study the cyclic color sequences induced at infinity by colored rays with apices being a given balanced finite bichromatic point set. We first study the case in which the rays are required to be pairwise disjoint. We ...
  • New results on production matrices for geometric graphs 

    Esteban Pascual, Guillermo; Huemer, Clemens; Silveira, Rodrigo Ignacio (2018-07-01)
    Article
    Accés restringit per política de l'editorial
    We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-angulations, which provide another way of counting the number of such objects. For instance, a formula for the number of ...
  • Geomasking through perturbation, or counting points in circles 

    Löffler, Maarten; Luo, Jun; Silveira, Rodrigo Ignacio (2017)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    Motivated by a technique in privacy protection, in which n points are randomly perturbed by at most a distance r, we study the following problem: Given n points and m circles in the plane, what is the maximum r such that ...

Mostra'n més