L'activitat del grup de recerca se centra en la Informàtica Gràfica i les seves aplicacions en els camps de la realitat augmentada, els jocs seriosos, el modelat i la visualització de dades volumètriques. Les aplicacions de la nostre recerca s'utilitza en els àmbits de la bioenginyeria, l'educació, la rehabilitació, la medicina, entre d'altres.

http://futur.upc.edu/GIE

Research and development of computer graphics applications, and computer-aided design and its application to engineering and bioengineering.

http://futur.upc.edu/GIE

Research and development of computer graphics applications, and computer-aided design and its application to engineering and bioengineering.

http://futur.upc.edu/GIE

Enviaments recents

  • Compact union of disjoint boxes: An efficient decomposition model for binary volumes 

    Cruz Matías, Irving; Ayala Vallespí, M. Dolors (2017)
    Article
    Accés obert
    This paper presents in detail the CompactUnion of Disjoint Boxes (CUDB), a decomposition modelfor binary volumes that has been recently but brieflyintroduced. This model is an improved version of aprevious model called ...
  • On the characterization of weighted simple games 

    Freixas Bosch, Josep; Freixas Boleda, Marc; Kurz, Sascha (2017-05-31)
    Capítol de llibre
    Accés restringit per política de l'editorial
    This paper has a twofold scope. The first one is to clarify and put in evidence the isomorphic character of two theories developed in quite different fields: on one side, threshold logic, on the other side, simple games. ...
  • Investigación-acción como metodología para el diseño de un serious game 

    Contreras Espinoza, Ruth Sofia; Eguía Gómez, Jose Luis; Solano Albajés, Lluís (2016-07)
    Article
    Accés obert
    Se ha producido un importante desarrollo en la investigación relacionada con los juegos educativos y, en especial, con los serious games y el aprendizaje basado en juegos digitales durante la última década. De particular ...
  • Can 3D gamified simulations be valid vocational training tools for persons with intellectual disability? A pilot based on a real-life situation 

    von Barnekow, Ariel; Bonet Codina, Núria; Tost Pardell, Daniela (2017-01-24)
    Article
    Accés restringit per política de l'editorial
    Objective: To investigate if 3D gamified simulations can be valid vocational training tools for persons with intellectual disability. Methods: A 3D gamified simulation composed by a set of training tasks for cleaning in ...
  • SKETCH'NDO: A framework for the creation of task-based serious games 

    Moya Santos, Sergi; Tost Pardell, Daniela; von Barnekow, Ariel; Félix, Eloy (2016-06-01)
    Article
    Accés restringit per política de l'editorial
    We present SKETCH'NDO, a framework for the interactive design and creation of single-user task-based serious games in 3D virtual environments. The games are dimensionally congruent: inherently 2D tasks such as reading and ...
  • A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs 

    Hidalgo, Marta R.; Joan Arinyo, Robert (2017-03-01)
    Article
    Accés restringit per política de l'editorial
    In this work we describe an algorithm to generate tree-decomposable minimally rigid graphs on a given set of vertices V . The main idea is based on the well-known fact that all minimally rigid graphs, also known as Laman ...
  • Ordering triangles in triangulated terrains over regular grids 

    Joan Arinyo, Robert; Alonso Alonso, Jesús (2016)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    In this work we report on a set of rules to visit triangles in triangulated height fields defined over regular grids in a back-to- front order with respect to an arbitrary viewpoint. With the viewpoint, we associate an ...
  • h-graphs: A new representation for tree decompositions of graphs 

    Hidalgo Garcia, Marta; Joan Arinyo, Robert (2014)
    Report de recerca
    Accés obert
    In geometric constraint solving, well constrained geometric problems can be abstracted as Laman graphs. If the graph is tree decomposable, the constraint-based geometric problem can be solved by a Decomposition-Recombination ...
  • On tree decomposability of Henneberg graphs 

    Hidalgo, Marta R.; Joan Arinyo, Robert (2014)
    Report de recerca
    Accés obert
    In this work we describe an algorithm that generates well constrained geometric constraint graphs which are solvable by the tree-decomposition constructive technique. The algorithm is based on Henneberg constructions and ...
  • Orientation, sphericity and roundness evaluation of particles using alternative 3D representations 

    Cruz Matías, Irving; Ayala Vallespí, M. Dolors (2014)
    Report de recerca
    Accés obert
    Sphericity and roundness indices have been used mainly in geology to analyze the shape of particles. In this paper, geometric methods are proposed as an alternative to evaluate the orientation, sphericity and roundness ...

Mostra'n més