Enviaments recents

  • Locating-dominating partitions in graphs 

    Pelayo Melero, Ignacio Manuel; Hernando Martín, María del Carmen; Mora Giné, Mercè (2016)
    Text en actes de congrés
    Accés obert
    Let G = (V, E) be a connected graph of order n. Let ¿ = {S1, . . . , Sk} be a partition of V . Let r(u|¿) denote the vector of distances between a vertex v ¿ V and the elements of ¿, that is, r(v, ¿) = (d(v, S1), . . . ...
  • Map construction algorithms: an evaluation through hiking data 

    Duran, David; Sacristán Adinolfi, Vera; Silveira, Rodrigo Ignacio (Association for Computing Machinery (ACM), 2017)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    We study five existing map construction algorithms, designed and tested with urban vehicle data in mind, and apply them to hiking trajectories with different terrain characteristics. Our main goal is to better understand ...
  • Implementing data-dependent triangulations with higher order Delaunay triangulations 

    Rodríguez, Natalia; Silveira, Rodrigo Ignacio (Association for Computing Machinery (ACM), 2016)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    The Delaunay triangulation is the standard choice for building triangulated irregular networks (TINs) to represent terrain surfaces. However, the Delaunay triangulation is based only on the 2D coordinates of the data points, ...
  • Stabbing circles for some sets of Delaunay segments 

    Claverol Aguas, Mercè; Khramtcova, Elena; Papadopoulou, Evanthia; Saumell, Maria; Seara Ojea, Carlos (2016)
    Text en actes de congrés
    Accés obert
    Let S be a set of n segments in the plane such that, for every segment, its two endpoints are adjacent in the Delaunay triangulation of the set of endpoints of all segments in S. Our goal is to compute all the combinatorially ...
  • Stabbing circles for sets of segments in the plane 

    Claverol Aguas, Mercè; Khramtcova, Elena; Papadopoulou, Evanthia; Saumell, Maria; Seara Ojea, Carlos (2016)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    Stabbing a set S of n segments in the plane by a line is a well-known problem. In this paper we consider the variation where the stabbing object is a circle instead of a line. We show that the problem is tightly connected ...
  • A new meta-module for efficient reconfiguration of hinged-units modular robots 

    Parada, Irene; Sacristán Adinolfi, Vera; Silveira, Rodrigo Ignacio (Institute of Electrical and Electronics Engineers (IEEE), 2016)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    We present a robust and compact meta-module for edge-hinged modular robot units such as M-TRAN, SuperBot, SMORES, UBot, PolyBot and CKBot, as well as for central-point-hinged ones such as Molecubes and Roombots. Thanks ...
  • Ramsey numbers for empty convex polygons 

    Bautista-Santiago, Crevel; Cano, Javier; Fabila-Monroy, Ruy; Hidalgo-Toscano, Carlos; Huemer, Clemens; Leaños, Jesús; Sakai, Toshinori; Urrutia, Jorge (University of Ljubljana, 2015)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    We study a geometric Ramsey type problem where the vertices of the complete graph Kn are placed on a set S of n points in general position in the plane, and edges are drawn as straight-line segments. We define the empty ...
  • On the disks with diameters the sides of a convex 5-gon 

    Huemer, Clemens; Pérez-Lantero, Pablo (Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II (MA2), 2015)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    We prove that for any convex pentagon there are two disks, among the five disks having a side of the pentagon as diameter and the midpoint of the side as its center, that do not intersect. This shows that K5 is never the ...
  • Region-based approximation algorithms for visibility between imprecise locations 

    Buchin, Kevin; Kostitsyna, Irina; Löffler, Maarten; Silveira, Rodrigo Ignacio (2015)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    In this paper we present new geometric algorithms for approximating the visibility between two imprecise locations amidst a set of obstacles, where the imprecise locations are modeled by continuous probability distributions. ...
  • Las habilidades sociales del docente universitario: una formación hacia la competencia interpersonal 

    Gómez Soberón, José Manuel Vicente; Berbegal Mirabent, Jasmina; Cañabate Carmona, Antonio; Farrerons Vidal, Óscar; Huerta Carrillo, María; Montero Mercadé, Lídia; Mora Giné, Mercè; Santos Boada, Germán; Torre Martínez, María del Rocío de la; Corral Manuel de Villena, Ignacio de (Congrés Internacional de Docència Universitària i Innovació (CIDUI), 2014)
    Comunicació de congrés
    Accés obert
    Desde el ICE de la UPC se ha planteado una nueva formación dirigida a todo el profesorado basada en la adquisición de competencias docentes. Uno de los módulos de formación puesto en marcha trabaja la adquisición de la ...

Mostra'n més