La geometria computacional, àrea primordial d'actuació del grup, és una disciplina a cavall entre les matemàtiques i la informàtica teòrica. El seu objectiu principal és el disseny i l'anàlisi d'algorismes per a la solució eficient de problemes geomètrics. En conseqüència, una tasca fonamental és la identificació de conceptes, propietats i tècniques que ajudin a la descoberta i implementació d'algorismes eficients. Això comporta l'estudi d'estructures de dades geomètriques, la complexitat d'algorismes, la representació i manipulació de figures i d'objectes, la construcció de llocs geomètrics i, més en general, el desenvolupament de la fonamentació geomètrica. En particular, els problemes estudiats inclouen la cerca i el recompte geomètrics, la convexitat i els processos afins, la proximitat, la intersecció, la triangulació, l'aproximació de formes i la visibilitat. Les àrees principals d'aplicació són la informàtica gràfica, el disseny i la fabricació assistits per ordinador, el reconeixement de formes, la morfologia geomètrica, el disseny VLSI, la visió per computador, els sistemes d'informació geogràfica i la robòtica.

http://futur.upc.edu/DCCG

Computational geometry, which is the main area of activity of the group, is a discipline that lies between mathematics and theoretical computer science. The group?s main objective is the design and analysis of algorithms for efficiently solving geometric problems. As a consequence, a fundamental task is to identify concepts, properties and techniques that will help to find and implement efficient geometric algorithms. This involves the study of geometric data structures, algorithm complexity, the representation and manipulation of figures and objects, geometric loci construction and, in general, the development of geometric principles. The problems studied include geometric search and enumeration, convexity and affine processes, proximity, intersection, triangulation, shape approximation and visibility. The main areas of application are computer graphics, computer-aided design and manufacturing, pattern recognition, computational morphology, VLSI design, computer vision, geographical information systems and robotics.

http://futur.upc.edu/DCCG

Computational geometry, which is the main area of activity of the group, is a discipline that lies between mathematics and theoretical computer science. The group?s main objective is the design and analysis of algorithms for efficiently solving geometric problems. As a consequence, a fundamental task is to identify concepts, properties and techniques that will help to find and implement efficient geometric algorithms. This involves the study of geometric data structures, algorithm complexity, the representation and manipulation of figures and objects, geometric loci construction and, in general, the development of geometric principles. The problems studied include geometric search and enumeration, convexity and affine processes, proximity, intersection, triangulation, shape approximation and visibility. The main areas of application are computer graphics, computer-aided design and manufacturing, pattern recognition, computational morphology, VLSI design, computer vision, geographical information systems and robotics.

http://futur.upc.edu/DCCG

Enviaments recents

  • The Plogi and ACi-1 operators on the polynomial time hierarchy 

    Castro Rabal, Jorge; Seara Ojea, Carlos (1993-11)
    Report de recerca
    Accés obert
    In a previous paper ([CS-92]) we studied the agreement of operators P_{log^i} and AC^{i-1} acting on NP. In this article we extend this work to other classes of the polynomial time hierarchy. We show that on Sigma_k^p, ...
  • General bounds on limited broadcast domination 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, Maria Luz; Cáceres, José (2016-09-19)
    Report de recerca
    Accés obert
    Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded by a constant k . The minimum cost of such a dominating broadcast is the k -broadcast dominating ...
  • New results on metric-locating-dominating sets of graphs 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; González, Antonio (2016-04-13)
    Report de recerca
    Accés obert
    A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distanc es from the elements of S , and the minimum cardinality of such a set is called the ...
  • The degree/diameter problem in maximal planar bipartite graphs 

    Dalfó Simó, Cristina; Huemer, Clemens; Salas Piñon, Julián (2016)
    Article
    Accés obert
    The (Δ,D)(Δ,D) (degree/diameter) problem consists of finding the largest possible number of vertices nn among all the graphs with maximum degree ΔΔ and diameter DD. We consider the (Δ,D)(Δ,D) problem for maximal planar ...
  • On the Partition Dimension and the Twin Number of a Graph 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2016-03-05)
    Report de recerca
    Accés obert
    A partition of the vertex set of a connected graph G is a locating partition of G if every vertex is uniquely determined by its vector of distances to the elements of . The partition dimension of G is the minimum ...
  • Perfect and quasiperfect domination in trees 

    Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, Maria Luz (2016-04-25)
    Article
    Accés obert
    A k quasip erfect dominating set of a connected graph G is a vertex subset S such that every vertex not in S is adjacent to at least one and at most k vertices in S . The cardinality of a minimum k-quasip erfect dominating ...
  • Opening the black box of energy throughputs in farm systems: a decomposition analysis between the energy returns to external inputs, internal biomass reuses and total inputs consumed (the Vallès County, Catalonia, c.1860 and 1999) 

    Tello, E.; Galán, E.; Sacristán Adinolfi, Vera; Cunfer, G.; Guzmán, G. I.; González de Molina, M.; Krausmann, F.; Gringrich, S.; Padró, R.; Marco, I.; Moreno-Delgado, D. (2016)
    Article
    Accés restringit per política de l'editorial
    We present an energy analysis of past and present farm systems aimed to contribute to their sustainability assessment. Looking at agroecosystems as a set of energy loops between nature and society, and adopting a farm-operator ...
  • Lower bounds on the maximum number of non-crossing acyclic graphs 

    Huemer, Clemens; Mier Vinué, Anna de (2015-08-01)
    Article
    Accés restringit per política de l'editorial
    This paper is a contribution to the problem of counting geometric graphs on point sets. More concretely, we look at the maximum numbers of non-crossing spanning trees and forests. We show that the so-called double chain ...
  • On k-gons and k-holes in point sets 

    Aichholzer, Oswin; Fabila Monroy, Ruy; Gonzalez Aguilar, Hernan; Hackl, Thomas; Heredia, Marco A.; Huemer, Clemens; Urrutia Galicia, Jorge; Valtr, Pavel; Vogtenhuber, Birgit (2015-08-01)
    Article
    Accés obert
    We consider a variation of the classical Erdos-Szekeres problems on the existence and number of convex k-gons and k-holes (empty k-gons) in a set of n points in the plane. Allowing the k-gons to be non-convex, we show ...
  • Ramsey numbers for empty convex polygons 

    Bautista-Santiago, Crevel; Cano, Javier; Fabila-Monroy, Ruy; Hidalgo-Toscano, Carlos; Huemer, Clemens; Leaños, Jesús; Sakai, Toshinori; Urrutia, Jorge (University of Ljubljana, 2015)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    We study a geometric Ramsey type problem where the vertices of the complete graph Kn are placed on a set S of n points in general position in the plane, and edges are drawn as straight-line segments. We define the empty ...

Mostra'n més