Now showing items 1-20 of 87

    • A constraint-based dynamic geometry system 

      Freixas Boleda, Marc; Joan Arinyo, Robert; Soto Riera, Antoni (Elsevier, 2010-02)
      Article
      Restricted access - publisher's policy
      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 ...
    • A cyber-physical educational game of Petanca: Petan-Camins 

      Chacón Flores, Rolando Antonio; Ramonell Cazador, Carlos; Puig i Polo, Càrol (Institute of Electrical and Electronics Engineers (IEEE), 2022)
      Conference report
      Restricted access - publisher's policy
      Continuously emerging technologies in Architecture, Engineering and Construction (AEC) are transforming the sector. In the Industry, the digitization of the built environment in manifold ways represents a pivotal moment ...
    • A new lower bound on the maximum number of plane graphs using production matrices 

      Huemer, Clemens; Pilz, Alexander; Silveira, Rodrigo Ignacio (2018)
      Conference lecture
      Restricted access - publisher's policy
      We use the concept of production matrices to show that there exist sets of n points in the plane that admit ¿(41.77n) crossing-free geometric graphs. This improves the previously best known bound of ¿(41.18n) by Aichholzer ...
    • A parametric-space-based scan-line algorithm for rendering of bicubic surfaces 

      Pueyo Sánchez, Xavier; Brunet Crosa, Pere (1987)
      Article
      Open Access
      A novel scan-line algorithm for displaying bicubic surfaces is presented. Patches are decomposed on regions of constant sign of the z component of the normal before the scan process. Most of the computations are done in ...
    • Algorithmic geometry with infinite time computation 

      Huemer, Clemens; Muller, Moritz Martin; Seara Ojea, Carlos; Tobar Nicolau, Adrián (2021)
      Conference report
      Restricted access - publisher's policy
    • Alya: Multiphysics engineering simulation toward exascale 

      Vázquez, Mariano; Houzeaux, Guillaume; Koric, Seid; Artigues, Antoni; Aguado Sierra, Jazmin; Arís Sánchez, Ruth; Mira Martínez, Daniel; Calmet, Hadrien; Cucchietti, Fernando; Owen, Herbert; Taha, Ahmed; Dering Burness, Evan; Cela Espín, José M.; Valero Cortés, Mateo (Elsevier, 2016-05)
      Article
      Open Access
      Alya is a multi-physics simulation code developed at Barcelona Supercomputing Center (BSC). From its inception Alya code is designed using advanced High Performance Computing programming techniques to solve coupled problems ...
    • Ampliación al espacio de una aplicación de la integración en el campo complejo para la solución de una cuestión de informática gráfica 

      Lerma Usero, Miguel Ángel (Institut d'Estadística de Catalunya, 1992)
      Article
      Open Access
      El teorema de los residuos de Cauchy sirve como base para un algoritmo que permite determinar la posición relativa de un punto respecto a una curva cerrada simple. La ampliación de este método al espacio tropieza con la ...
    • Amueblado de propiedades en 3D 

      Ramos Refusta, Joan Manuel (Universitat Politècnica de Catalunya, 2021-06-30)
      Bachelor thesis
      Restricted access - confidentiality agreement
      Floorfy es una de las empresas que se dedica a realizar renders tridimensionales de hogares para inmobiliarias. Estos renders se les llama tours virtuales. Este servicio tiene muchas ventajas y facilidades para el usuario. ...
    • Analysis and Prediction of Human Motion Trajectories in Urban Environments 

      Ferrer M´ınguez, Gonzalo (Universitat Politècnica de Catalunya, 2011-09)
      Master thesis
      Restricted access - author's decision
      The design and development of intelligent service mobile robots that interact with humans in daily living activities or cooperate with persons in specific tasks, requires the design of new tools that allow the understanding ...
    • Blocking the k-holes of point sets in the plane 

      Cano, Javier; Garcia Olaverri, Alfredo Martin; Hurtado Díaz, Fernando Alfredo; Shakai, Toshinori; Tejel Altarriba, Francisco Javier; Urrutia Galicia, Jorge (2015-09)
      Article
      Open Access
      Let P be a set of n points in the plane in general position. A subset H of P consisting of k elements that are the vertices of a convex polygon is called a k-hole of P, if there is no element of P in the interior of its ...
    • Boolean operations for 3D simulation of CNC machining 

      Tost Pardell, Daniela; Puig Puig, Anna; Pérez Vidal, Lluís (2002-07-04)
      Research report
      Open Access
      This paper addresses the simulation of drilling tools CNC machining. It describes a novel approach for the computation of the boundary representation of the machined tools. Machining consists of a sequence of boolean ...
    • Caminos de desviación mínima local 

      Abellanas, Manuel; Hernández, Gregorio; Sacristán Adinolfi, Vera (U. Zaragoza, 2009)
      Conference report
      Open Access
      Un camino que conecta dos puntos s y t en el plano es de desviación mínima respecto de un conjunto de puntos S si la mayor de las distancias entre un punto del camino y S es la menor posible entre todos los caminos que ...
    • Colored Ray configurations 

      Fabila Monroy, Ruy; Garcia Olaverri, Alfredo Martin; Hurtado Díaz, Fernando Alfredo; Jaume, Rafel; Pérez Lantero, Pablo; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Urrutia Galicia, Jorge (2014)
      Conference report
      Open Access
      We study the cyclic sequences induced at in nity by pairwise-disjoint colored rays with apices on a given bal- anced bichromatic point set, where the color of a ray is inherited from the color of its apex. We derive a lower ...
    • Combining geometric and appearance priors for pose recovery 

      Seradel Domingo, Eduard (Universitat Politècnica de Catalunya, 2009-09)
      Master thesis
      Restricted access - author's decision
      Estimar la pose (rotació i translació) de la càmera a partir dels punts d'interés de l'escena 3D i punts de la imatge 2D és un problema ben resolt en el cas que es coneguin les correspondències entre ells. No obstant, quan ...
    • Computing a visibility polygon using few variables 

      Barba, Luis; Korman Cozzetti, Matías; Langerman, Stefan; Silveira, Rodrigo Ignacio (2014-10-01)
      Article
      Restricted access - publisher's policy
      We present several algorithms for computing the visibility polygon of a simple polygon P of n vertices (out of which r are reflex) from a viewpoint inside P, when P resides in read-only memory and only few working variables ...
    • Computing correlation between piecewise-linear functions 

      Agarwal, Pankaj; Aronov, Boris; Van Kreveld, Matias; Löffler, Maarten; Silveira, Rodrigo Ignacio (2013)
      Article
      Restricted access - publisher's policy
      We study the problem of computing correlation between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in three dimensions---polyhedral terrains---can be transformed ...
    • Computing maximal tiles and application to impostor-based simplification 

      Andújar Gran, Carlos Antonio; Brunet Crosa, Pere; Chica Calaf, Antonio; Navazo Álvaro, Isabel; Rossignac, Jarek; Vinacua Pla, Álvaro (North Holland, 2004-08)
      Article
      Restricted access - publisher's policy
      The computation of the largest planar region approximating a 3D object is an important problem with wide applications in modeling and rendering. Given a voxelization of the 3D object, we propose an efficient algorithm to ...
    • Configurations of non-crossing rays and related problems 

      Garcia Olaverri, Alfredo Martin; Hurtado Díaz, Fernando Alfredo; Tejel Altarriba, Francisco Javier; Urrutia Galicia, Jorge (2016-04)
      Article
      Open Access
      Let S be a set of n points in the plane and let R be a set of n pairwise non-crossing rays, each with an apex at a different point of S. Two sets of non-crossing rays R1R1 and R2R2 are considered to be different if the ...
    • Data-driven tetrahedral mesh subdivision 

      Rodríguez Pérez, Lyudmila Odalina; Navazo Álvaro, Isabel; Vinacua Pla, Álvaro (North Holland, 2007-12)
      Article
      Restricted access - publisher's policy
      Given a tetrahedral mesh immersed in a voxel model, we present a method to refine the mesh to reduce the discrepancy between interpolated values based on either scheme at arbitrary locations. An advantage of the method ...
    • 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
      Restricted access - publisher's policy
      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 ...