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 ...
  • 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 ...
  • Computer-based cognitive rehabilitation: the CoRe system 

    Alloni, Anna; Sinforiani, Elena; Zuchella, Chiara; Sandrini, Giorgio; Bernini, Sara; Cattani, Barbara; Tost Pardell, Daniela; Quaglini, Silvana; Pistarini, Caterina (2015-10-27)
    Article
    Accés obert
    This work aims at providing a tool for supporting cognitive rehabilitation. This is a wide field, that includes a variety of diseases and related clinical pictures; for this reason the need arises to have a tool available ...
  • Juegos digitales desde el punto de vista de los professores : una experiencia didáctica en aulas primaria catalanas 

    Eguía Gómez, Jose Luis; Contreras Espinoza, Ruth Sofia; Solano Albajés, Lluís (2015-06-16)
    Article
    Accés obert
    Este artículo presenta una experiencia didáctica centrada en la aplicación de un juego digital en las aulas catalanas de quinto y sexto grado de educación primaria. En él se explica y analizan los efectos de su aplicación ...
  • h-graphs : a new representation for tree decompositions of graphs 

    Hidalgo Garcia, Marta; Joan Arinyo, Robert (2015-10-01)
    Article
    Accés obert
    In geometric constraint solving, 2D 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 ...
  • Serious games for screening pre-dementia conditions: from virtuality to reality? A pilot project 

    Zuchella, Chiara; Sinforiani, Elena; Tassorelli, Cristina; Cavallini, Elena; Tost Pardell, Daniela; Grau Carrion, Sergi; Pazzi, Stefania; Puricelli, Stefano; Bernini, Sara; Bottiroli, Sara; Vecchi, Tomaso; Sandrini, Giorgio; Nappi, Giuseppe (2014-11-02)
    Article
    Accés restringit per política de l'editorial
    Conventional cognitive assessment is based on a pencil-and-paper neuropsychological evaluation, which is time consuming, expensive and requires the involvement of several professionals. Information and communication ...
  • Decomposition of geometric constraint graphs based on computing fundamental circuits. Correctness and complexity 

    Joan Arinyo, Robert; Tarres Puertas, Marta Isabel; Vila Marta, Sebastià (2014-07-01)
    Article
    Accés restringit per política de l'editorial
    In geometric constraint solving, Decomposition Recombination solvers (DR-solvers) refer to a general solving approach where the problem is divided into a set of sub-problems, each sub-problem is recursively divided until ...
  • The three-dimensional cube and scale cube skeleton 

    Martínez Bayona, Jonàs; Pla García, Núria; Vigo Anglada, Marc (Springer, 2014)
    Article
    Accés restringit per política de l'editorial
    The recently introduced cube and scale cube skeleton of Martínez et al. (Graph Models 75:189–207, 2013) are a new type of skeletal representations for polygons or polyhedra enclosed by axis-aligned edges or faces. In this ...
  • First-person locomotion in 3D virtual environments: a usability analysis 

    Moya Santos, Sergio; Grau Carrion, Sergi; Tost Pardell, Daniela (2014)
    Article
    Accés obert
    3D Virtual Environments (VE) are becoming popular as a tool for cognitive, functional and psychological assessment. Navigation in these environments is recognized as one of the most difficult activities in 3D Virtual ...

Mostra'n més