Tangible user interfaces : past, present and future directions

In the last two decades, Tangible User Interfaces (TUIs) have emerged as a new interface type that interlinks the digital and physical worlds. Drawing upon users' knowledge and skills of interaction with the real non-digital world, TUIs show a potential to enhance the way in which people interact with and leverage digital information. However, TUI research is still in its infancy and extensive research is required in or- der to fully understand the implications of tangible user interfaces, to develop technologies that further bridge the digital and the physical, and to guide TUI design with empirical knowledge. This paper examines the existing body of work on Tangible User In- terfaces. We start by sketching the history of tangible user interfaces, examining the intellectual origins of this field. We then present TUIs in a broader context, survey application domains, and review frame- works and taxonomies. We also discuss conceptual foundations of TUIs including perspectives from cognitive sciences, phycology, and philoso- phy. Methods and technologies for designing, building, and evaluating TUIs are also addressed. Finally, we discuss the strengths and limita- tions of TUIs and chart directions for future research

Developmental disorders

Introduction: Connectionist models have recently provided a concrete computational platform from which to explore how different initial constraints in the cognitive system can interact with an environment to generate the behaviors we find in normal development (Elman et al., 1996; Mareschal & Thomas, 2000). In this sense, networks embody several principles inherent to Piagetian theory, the major developmental theory of the twentieth century. By extension, these models provide the opportunity to explore how shifts in these initial constraints (or boundary conditions) can result in the emergence of the abnormal behaviors we find in atypical development. Although this field is very new, connectionist models have already been put forward to explain disordered language development in Specific Language Impairment (Hoeffner & McClelland, 1993), Williams Syndrome (Thomas & Karmiloff-Smith, 1999), and developmental dyslexia (Seidenberg and colleagues, see e.g. Harm & Seidenberg, in press); to explain unusual characteristics of perceptual discrimination in autism (Cohen, 1994; Gustafsson, 1997); and to explore the emergence of disordered cortical feature maps using a neurobiologically constrained model (Oliver, Johnson, Karmiloff-Smith, & Pennington, in press). In this entry, we will examine the types of initial constraints that connectionist modelers typically build in to their models, and how variations in these constraints have been proposed as possible accounts of the causes of particular developmental disorders. In particular, we will examine the claim that these constraints are candidates for what will constitute innate knowledge. First, however, we need to consider a current debate concerning whether developmental disorders are a useful tool to explore the (possibly innate) structure of the normal cognitive system. We will find that connectionist approaches are much more consistent with one side of this debate than the other

Integration over curves and surfaces defined by the closest point mapping

We propose a new formulation for integrating over smooth curves and surfaces that are described by their closest point mappings. Our method is designed for curves and surfaces that are not defined by any explicit parameterization and is intended to be used in combination with level set techniques. However, contrary to the common practice with level set methods, the volume integrals derived from our formulation coincide exactly with the surface or line integrals that one wish to compute. We study various aspects of this formulation and provide a geometric interpretation of this formulation in terms of the singular values of the Jacobian matrix of the closest point mapping. Additionally, we extend the formulation - initially derived to integrate over manifolds of codimension one - to include integration along curves in three dimensions. Some numerical examples using very simple discretizations are presented to demonstrate the efficacy of the formulation.Comment: Revised the pape

Cylindrical and Toroidal Parameterizations Without Vertex Seams

A simple rendering method to avoid vertex seams in cylindrical and toroidal UV mappings used for texture mapping is presented. (A vertex seam is a vertex duplication of a polygonal mesh with different texture coordinates assigned to the two geometrically coinciding copies.) As a result, the method leads to simpler, leaner, replication-free data structures. Is also allows for a higher degree of proceduralism in generation of texture coordinates. The method is general, trivial to implement (exhaustive pseudocode is provided), very low in cost on resources (with a virtually null impact on performance), and it leverages only basic mechanisms widely available in most GPU implementations. An open-source implementation is available online

Generation of Curved High-order Meshes with Optimal Quality and Geometric Accuracy

We present a novel methodology to generate curved high-order meshes featuring optimal mesh quality and geometric accuracy. The proposed technique combines a distortion measure and a geometric Full-size image (<1 K)-disparity measure into a single objective function. While the element distortion term takes into account the mesh quality, the Full-size image (<1 K)-disparity term takes into account the geometric error introduced by the mesh approximation to the target geometry. The proposed technique has several advantages. First, we are not restricted to interpolative meshes and therefore, the resulting mesh approximates the target domain in a non-interpolative way, further increasing the geometric accuracy. Second, we are able to generate a series of meshes that converge to the actual geometry with expected rate while obtaining high-quality elements. Third, we show that the proposed technique is robust enough to handle real-case geometries that contain gaps between adjacent entities.This research was partially supported by the Spanish Ministerio de Economía y Competitividad under grand contract CTM2014-55014-C3-3-R, and by the Government of Catalonia under grand contract 2014-SGR-1471. The work of the last author was supported by the European Commission through the Marie Sklodowska-Curie Actions (HiPerMeGaFlows project).Peer ReviewedPostprint (published version

A distortion measure to validate and generate curved high-order meshes on CAD surfaces with independence of parameterization

This is the accepted version of the following article: [Gargallo-Peiró, A., Roca, X., Peraire, J., and Sarrate, J. (2016) A distortion measure to validate and generate curved high-order meshes on CAD surfaces with independence of parameterization. Int. J. Numer. Meth. Engng, 106: 1100–1130. doi: 10.1002/nme.5162], which has been published in final form at http://onlinelibrary.wiley.com/doi/10.1002/nme.5162/abstractA framework to validate and generate curved nodal high-order meshes on Computer-Aided Design (CAD) surfaces is presented. The proposed framework is of major interest to generate meshes suitable for thin-shell and 3D finite element analysis with unstructured high-order methods. First, we define a distortion (quality) measure for high-order meshes on parameterized surfaces that we prove to be independent of the surface parameterization. Second, we derive a smoothing and untangling procedure based on the minimization of a regularization of the proposed distortion measure. The minimization is performed in terms of the parametric coordinates of the nodes to enforce that the nodes slide on the surfaces. Moreover, the proposed algorithm repairs invalid curved meshes (untangling), deals with arbitrary polynomial degrees (high-order), and handles with low-quality CAD parameterizations (independence of parameterization). Third, we use the optimization procedure to generate curved nodal high-order surface meshes by means of an a posteriori approach. Given a linear mesh, we increase the polynomial degree of the elements, curve them to match the geometry, and optimize the location of the nodes to ensure mesh validity. Finally, we present several examples to demonstrate the features of the optimization procedure, and to illustrate the surface mesh generation process.Peer ReviewedPostprint (author's final draft