http://hdl.handle.net/2117/3298 2013-05-19T17:08:43Z http://hdl.handle.net/2117/17570 Title: Eines de la web 2.0 per a la coordinació d'assignatures: resultats preliminars Authors: Giralt Mas, Ma. Rosa; Bonet Dalmau, Jordi; Vila Marta, Sebastià; Palà Schönwälder, Pere; Águila López, Francisco del Abstract: Aquesta comunicació presenta els resultats d'utilització d'un Dipòsit de Material Docent amb les característiques pròpies de l'Open Course Ware, en el primer quadrimestre del nou grau en Enginyeria de Sistemes TIC que ofereix la Universitat Politècnica de Catalunya a l'Escola Politècnica Superior d'Enginyeria de Manresa. Aquesta acció s’emmarca en un projecte docent més ampli que abasta els tres primers quadrimestres del grau i la implantació d'una wiki a partir del segon quadrimestre. Aquest projecte més ampli té per objectiu millorar l'eficiència en l'aprenentatge introduint la web 2.0 com a eina quotidiana de coordinació del professorat i de treball en equip de l'alumnat. 2013-02-04T16:34:37Z http://hdl.handle.net/2117/13628 Title: Tecnologías complementarias: dos asignaturas del nuevo grado en ingeniería de sistemas TIC enfocadas a las competencias genéricas Authors: Escobet Canal, Teresa; Giralt Mas, Ma. Rosa; Palà Schönwälder, Pere; Vila Marta, Sebastià; Argelaguet Isanta, María Rosa Abstract: En el marco de la adaptación de las titulaciones al EEES, en la EPSEM se decidió impartir el grado en ingeniería de sistemas TIC. Este nuevo grado tiene por objetivo formar profesionales con un perfil generalista e integrador en el ámbito de las tecnologías electrónica, informática y de comunicaciones. Las materias de que consta el plan de estudios se focalizan en el estudio de dichas temáticas. En la elaboración de dicho plan de estudios, se consideró necesario introducir dos asignaturas, denominadas Tecnologías Complementarias 1 y 2, en las cuales se pretende aportar conocimientos relacionados la tecnología en general. Concretamente, se pretenden abordar algunos conocimientos del ámbito industrial y del ámbito social, así como, metodologías de trabajo individual y colectivo. En este artículo presentamos como se han planificado ambas asignaturas y los objetivos a conseguir. Se describen alguna de las actividades propuestas. 2011-10-21T17:39:15Z http://hdl.handle.net/2117/13626 Title: La integración de las tecnologías electrónica, informática y comunicaciones: diseño del nuevo grado en ingeniería de sistemas TIC Authors: Giralt Mas, Ma. Rosa; Palà Schönwälder, Pere; Escobet Canal, Teresa; Vila Marta, Sebastià; Argelaguet Isanta, María Rosa Abstract: La adaptación de las titulaciones al EEES ha supuesto un debate organizativo dentro de las universidades. En la EPSEM se decidió que uno de los grados que imparte fuera del ámbito TIC. Después de estudiar las necesidades de las empresas y el entorno industrial, el potencial interno de la escuela y los referentes externos, como pueden ser las recomendaciones de organizaciones profesionales y los grados impartidos por universidades extranjeras, se decidió apostar per un grado innovador y único en España: el grado en ingeniería de sistemas TIC. Este grado debería dar salida a titulados de un perfil generalista e integrador de las tecnologías electrónica, informática y de comunicaciones, dado que, hoy en día, ya no se conciben dispositivos que no integren al menos dos de estas tecnologías. La propuesta fue aprobada por la ANECA y el grado se ha empezado a impartir este curso con éxito. 2011-10-21T17:32:09Z http://hdl.handle.net/2117/9918 Title: Frame-to-frame coherent GPU splatting Authors: Grau Carrion, Sergi; Tost Pardell, Daniela Abstract: Recently, several improvements of the classical splatting volume rendering technique have been proposed, specifically, GPU implementations that considerably speed it up. However, splatting time-varying data, even using the GPU, is still slow and not very suitable for interactive data exploration through time. In this paper, we propose a GPU-based viewaligned splatting algorithm that exploits frame-to-frame coherence to render time-varying volume datasets. Our method run-length encodes time-varying data in the GPU. At each frame, we update view-aligned buckets that store the voxels contributing to each sheet-buffer. If the camera moves, the buckets are sorted in the GPU, otherwise they are directly used to compute the sheet-buffers. Our method supports interactive exploration of the data through time as well as camera and transfer function changes. 2010-10-22T09:56:43Z http://hdl.handle.net/2117/8461 Title: A Hybrid Rendering Technique to Navigate in Large Terrains Using Mobile Devices Authors: Noguera, José María; Segura, Rafael; Ogáyar, Carlos; Joan Arinyo, Robert Abstract: We describe a hybrid client-server technique for remote adaptive streaming and rendering of large terrains in resource-limited mobile devices. The technique has been designed to achieve an interactive rendering performance on a mobile device connected to a low-bandwidth wireless network. The rendering workload is split between the client and the server. The terrain area close to the viewer is rendered in real-time by the client. The terrain located far from the viewer is portrayed as view-dependent impostors, rendered by the server on demand. A prototype has been built and an exhaustive set of experiments covering several platforms, wireless networks and a wide range of viewer velocities has been conducted. Results show that the approach is feasible, effective and robust. 2010-07-29T15:29:37Z http://hdl.handle.net/2117/8114 Title: Skeleton computation of an image using a geometric approach Authors: Martínez Bayona, Jonás; Vigo Anglada, Marc; Pla García, Núria; Ayala Vallespí, M. Dolors Abstract: In this work we develop two algorithms to compute the skeleton of a binary 2D image. Both algorithms follow a geometric approach and work directly with the boundary of the image which is an orthogonal polygon (OP). One of these algorithms processes the edges of the polygon while the other one uses its vertices. Compared with a thinning method, the presented algorithms show a good performance. This is a work in progress as our final goal is to extend the vertex-based algorithm method to 3D in order to compute the surface skeleton of a binary volume. 2010-07-09T16:32:19Z http://hdl.handle.net/2117/8061 Title: Geometric Constraint Graphs Decomposition Based on Computing Graph Circuits Authors: Joan Arinyo, Robert; Tarres Puertas, Marta Isabel; Vila Marta, Sebastià Abstract: Geometric constraint solving is a growing field which plays a paramount role in industrial applications and that is deeply rooted in automated deduction in geometry. In this work we report on an algorithm to solve geometric constraint-based problems by decomposing biconnected graphs. The algorithm is based on recursively splitting the graph through sets with three vertices located on fundamental circuits of the graph. Preliminary practical experiments suggest that the algorithm runtime is at worst quadratic with the total number of vertices in the graph. 2010-07-07T15:15:04Z http://hdl.handle.net/2117/8060 Title: The Grounded Heightmap Tree. A New Data Structure for Terrain Representation Authors: Alonso Alonso, Jesús; Joan Arinyo, Robert; Solano Albajés, Lluís Abstract: Terrain modeling is a fast growing field with many applications such as computer graphics, resource management, Earth and environmental sciences, civil and military engineering, surveying and photogrammetry and games programming. One of the most widely used terrain model is the Digital Elevation Model (DEM). A DEM is a simple regularly spaced grid of elevation points that represent the continuous variation of relief over space. DEMs require simple storage and are compatible with satellite data. However, they do not easily account for overhangs. In this work we report on the Grounded Heightmap Tree, a new data structure for terrain representation built as a generalization of the DEM. The new data structure allows to naturally represent terrain overhangs. We illustrate the performance of the Grounded Heightmap Tree when applied to represent terrains that undergo big changes. 2010-07-07T15:03:03Z http://hdl.handle.net/2117/8059 Title: A Constraint-Based Dynamic Geometry System Authors: Freixas Boleda, Marc; Joan Arinyo, Robert; Soto Riera, Antoni Abstract: Dynamic geometry systems are tools for geometric visualization. They allow the user to define geometric elements, establish relationships between them and explore the dynamic behavior of the remaining geometric elements when one of them is moved. The main problem in dynamic geometry systems is the ambiguity that arises from operations which lead to more than one possible solution. Most dynamic geometry systems deal with this problem in such a way that the solution selection method leads to a fixed dynamic behavior of the system. This is specially annoying when the behavior observed is not the one the user intended. In this work we propose a modular architecture for dynamic geometry systems built upon a set of functional units which will allow to apply some well known results from the Geometric Constraint Solving field. A functional unit called filter will provide the user with tools to unambiguously capture the expected dynamic behavior of a given geometric problem. 2010-07-07T14:42:59Z http://hdl.handle.net/2117/7779 Title: Treedecomposition of geometric constraint graphs based on computing graph circuits Authors: Tarres Puertas, Marta Isabel; Vila Marta, Sebastià; Joan Arinyo, Robert Abstract: The graph-based geometric constraint solving technique works in two steps. First the geometric problem is translated into a graph whose vertices represent the set of geometric elements and whose edges are the constraints. Then the constraint problem is solved by decomposing the graph into a collection of subgraphs each representing a standard problem which is solved by a dedicated equational solver. In this work we report on an algorithm to decompose biconnected tree-decomposable graphs representing either underor wellconstrained 2D geometric constraint problems. The algorithm recursively first computes a set of fundamental circuits in the graph then splits the graph into a set of subgraphs each sharing exactly three vertices with the fundamental circuit. Practical experiments show that the reported algorithm clearly outperforms the treedecomposition approach based on identifying subgraphs by applying specific decomposition rules. 2010-06-21T18:52:11Z http://hdl.handle.net/2117/7700 Title: Elements for a modular dynamic geometry system Authors: Freixas Boleda, Marc; Joan Arinyo, Robert; Soto Riera, Antoni Abstract: Dynamic geometry systems are tools for geometric visualization. They allow the user to define geometric elements, establish relationships between them and explore the dynamic behavior of the remaining geometric elements when one of them is moved. In this work we propose a modular architecture for dynamic geometry systems built upon a set of functional units which will allow to apply some well known results from the Geometric Constraint Solving field. 2010-06-16T15:12:23Z http://hdl.handle.net/2117/7443 Title: Improved virtual porosimeter Authors: Vergés Garcia, Eduard; Ayala Vallespí, M. Dolors Abstract: Recently, the term BioCAD has appeared to refer to the modeling of biological processes. This work focuses on the analysis of structural properties such as porosity of bioimplants for bone reconstruction. Specifically, we present a method that, using 3D microCT images, simulates the behavior of a porosimeter, i.e. an instrument to measure the porous structure of a sample. After segmentation, we perform an intrusion simulation using the distance map, topological skeleton and connected component labeling of the volume’s porous region, which produces a result comparable to the real porosimeter experiment. This initial method has been modified to take advantage of the properties of the Extreme Vertices Model (EVM), which is a very compact form of volume representation with simple base operations. The output is the same yet the computation is faster. 2010-05-31T16:07:29Z http://hdl.handle.net/2117/7379 Title: Bio-CAD analysis of porosity bioimplants Authors: Vergés Garcia, Eduard; Ayala Vallespí, M. Dolors; Grau Carrion, Sergi; Tost Pardell, Daniela Abstract: In this work we present two methods to compute the porosity from a μCT image. One is the virtual simulation of a porosimeter and the other is a sphere-based heuristic approach. Both methods obtain a graph representing the pore space. 2010-05-26T11:13:48Z http://hdl.handle.net/2117/7080 Title: From Degenerate Patches to Triangular and Trimmed Patches Authors: Vigo Anglada, Marc; Pla García, Núria; Brunet Crosa, Pere 2010-04-26T14:07:39Z http://hdl.handle.net/2117/6971 Title: Collision prediction using MKtrees Authors: Franquesa Niubó, Marta; Brunet Crosa, Pere Abstract: K dimensional tree data structure(Multiresolution Kdtree, MKtree) is introduced. In a complex scene containing a high number of individual objects, the MKtree represents a hierarchical subdivision of the scene objects that guarantees a small space overlap between node regions. The proposed MKtree data structure succeeds in performing simultaneously space and scene subdivision. MKtrees are useful for broad phase collision and proximity detection tests and for time-critical rendering in large environments requiring external memory storage. The paper proposes an efficient broad phase collision prediction algorithm. Examples in ship design applications are presented and discussed. 2010-04-19T11:13:59Z