Ara es mostren els items 1-20 de 23

  • An algorithmic framework for segmenting trajectories based on spatio-temporal criteria 

    Buchin, Maike; Driemel, Anne; Kreveld, Marc van; Sacristán Adinolfi, Vera (Association for Computing Machinery (ACM), 2010)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    In this paper we address the problem of segmenting a trajectory such that each segment is in some sense homogeneous. We formally define different spatio-temporal criteria under which a trajectory can be homogeneous, including ...
  • 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 obert
    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 ...
  • A proposal for a workable analysis of Energy Return on Investment (EROI) in agroecosystems. Part I: Analytical approach 

    Tello, E.; Galán, E.; Cunfer, G.; Guzmán, G.; González de Molina, M.; Krausmann, F.; Gingrich, S.; Sacristán Adinolfi, Vera; Marco, I.; Padró, R.; Moreno-Delgado, D. (2015)
    Article
    Accés obert
    This paper presents a workable approach to the energy analysis of past and present agroecosystems aimed to contribute to their sustainability assessment. This analysis sees the agroecosystem as a set of energy loops between ...
  • Caminos de desviación mínima local 

    Abellanas, Manuel; Hernández, Gregorio; Sacristán Adinolfi, Vera (U. Zaragoza, 2009)
    Text en actes de congrés
    Accés obert
    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 spanning graphs for set visualization 

    Hurtado Díaz, Fernando Alfredo; Korman, Matias; Van Kreveld, Matias; Löffler, Maarten; Sacristán Adinolfi, Vera; Shioura, Akiyoshi; Silveira, Rodrigo Ignacio; Speckmann, Bettina; Tokuyama, Takeshi (2018-03)
    Article
    Accés restringit per política de l'editorial
    We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations. Our input is a set of points in the plane which are either blue, red, or purple. Blue points belong exclusively to the ...
  • Colored spanning graphs for set visualization 

    Hurtado Díaz, Fernando Alfredo; Korman Cozzetti, Matías; Van Kreveld, Matias; Löffler, Maarten; Sacristán Adinolfi, Vera; Silveira, Rodrigo Ignacio; Speckmann, Bettina (Springer, 2013)
    Text en actes de congrés
    Accés obert
    We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations. Our input is a set of points in the plane which are either blue, red, or purple. Blue points belong exclusively to the ...
  • Coverage with k-transmitters in the presence of obstacles 

    Uehara, R.; Souvaine, D.; Sacristán Adinolfi, Vera; Morin, P.; Lubiw, A.; Iacono, J.; Ballinger, B.; Benbernou, N.; Bose, P.; Damian, M.; Demaine, E. D.; Dujmovic, Vida; Flatland, R.; Hurtado Díaz, Fernando Alfredo (Springer Verlag, 2010)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    For a fixed integer k ≥ 0, a k-transmitter is an omnidirectional wireless transmitter with an infinite broadcast range that is able to penetrate up to k “walls”, represented as line segments in the plane. We develop lower ...
  • DVALon: una herramienta para diagramas de Voronoi y grafos de proximidad de alcance limitado 

    Abellanas, Manuel; Hernández, Gregorio; Moreno, José Luis; Ordóñez, Sergio; Sacristán Adinolfi, Vera (Prensas Universitarias de Zaragoza, 2009)
    Text en actes de congrés
    Accés obert
    Presentamos un estudio de los diagramas de Voronoi de alcance limitado de un conjunto finito de puntos del plano y DVALon, una herramienta para la manipulaci´on de dichos diagramas, los grafos de proximidad de alcance ...
  • Efficient constant-velocity reconfiguration of crystalline robots 

    Wuhrer, S.; Sacristán Adinolfi, Vera; Ramaswami, Suneeta; Pinciu, Val; Aloupis, G.; Collette, S.; Damian, M.; Demaine, E. D.; El-Khechen, Dania; Flatland, R.; Langerman, S.; O'Rourke, J. (2011)
    Article
    Accés obert
    In this paper we propose novel algorithms for reconfiguring modular robots that are composed of n atoms. Each atom has the shape of a unit cube and can expand/contract each face by half a unit, as well as attach to or ...
  • El cost d’estudiar a Europa: Preus, beques, préstecs i altres ajuts a les universitats europees (2013-14) 

    Sacristán Adinolfi, Vera (2014-06)
    Llibre
    Accés obert
    Presentem un estudi dels preus públics universitaris de grau i de màster del curs 2013-14 a 38 països o regions de 32 estats d’Europa. L’informe ofereix també dades sobre els imports de les beques i el nombre d’estudiants ...
  • El PDI a la Universitat 

    Universitat Politècnica de Catalunya; Sacristán Adinolfi, Vera (Universitat Politècnica de Catalunya, 2002-12-31)
    Audiovisual
    Accés obert
  • Empty triangles in good drawings of the complete graph 

    Aichholzer, Oswin; Hackl, Thomas; Pilz, Alexander; Ramos Alonso, Pedro Antonio; Sacristán Adinolfi, Vera; Vogtenhuber, Birgit (2015)
    Article
    Accés obert
    A good drawing of a simple graph is a drawing on the sphere or, equivalently, in the plane in which vertices are drawn as distinct points, edges are drawn as Jordan arcs connecting their end vertices, and any pair of edges ...
  • Improving shortest paths in the Delaunay triangulation 

    Abellanas, Manuel; Claverol Aguas, Mercè; Hernández-Peñalver, Gregorio; Hurtado Díaz, Fernando Alfredo; Sacristán Adinolfi, Vera; Saumell Mendiola, Maria; Silveira, Rodrigo Ignacio (2012)
    Article
    Accés obert
    We study a problem about shortest paths in Delaunay triangulations. Given two nodes s, t in the Delaunay triangulation of a point set P, we look for a new point p that can be added, such that the shortest path from s to ...
  • La exigua, desigual y menguante financiación de la universidad pública española (2009-2015) 

    Sacristán Adinolfi, Vera (2018-01-25)
    Article
    Accés obert
  • 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 ...
  • Opening the black box of energy throughputs in farm systems: a decomposition analysis between the energy returns to external inputs, internal biomass reuses and total inputs consumed (the Vallès County, Catalonia, c.1860 and 1999) 

    Tello, E.; Galán, E.; Sacristán Adinolfi, Vera; Cunfer, G.; Guzmán, G. I.; González de Molina, M.; Krausmann, F.; Gringrich, S.; Padró, R.; Marco, I.; Moreno-Delgado, D. (2016)
    Article
    Accés obert
    We present an energy analysis of past and present farm systems aimed to contribute to their sustainability assessment. Looking at agroecosystems as a set of energy loops between nature and society, and adopting a farm-operator ...
  • Proximity graphs inside large weighted graphs 

    Ábrego, Bernardo M.; Fabila Monroy, Ruy; Fernández-Merchant, Silvia; Flores Peñaloza, David; Hurtado Díaz, Fernando Alfredo; Meijer, Henk; Sacristán Adinolfi, Vera; Saumell Mendiola, Maria (2010)
    Text en actes de congrés
    Accés obert
    Given a large weighted graph G = (V;E) and a subset U of V , we de¯ne several graphs with vertex set U in which two vertices are adjacent if they satisfy some prescribed proximity rule. These rules use the shortest path ...
  • Realistic reconfiguration of crystalline (and telecube) robots 

    Wuhrer, Stefanie; Sacristán Adinolfi, Vera; Ramaswami, Suneeta; Pinciu, Val; Aloupis, Greg; Collette, Sébastien; Damian, Mirela; Demaine, Erik D.; El-Khechen, Dania; Flatland, Robin; Langerman, Stefan; O'Rourke, Joseph (CIMAT, 2008)
    Text en actes de congrés
    Accés obert
    In this paper we propose novel algorithms for reconfiguring modular robots that are composed of n atoms. Each atom has the shape of a unit cube and can expand/contract each face by half a unit, as well as attach to or ...
  • Reconfiguration of cube-style modular robots using O(logn) parallel moves 

    Aloupis, Greg; Collette, Sébastien; Demaine, Erik D.; Langerman, Stefan; Sacristán Adinolfi, Vera; Wuhrer, Stefanie (Lecture Notes in Computer Science LNCS 5369, Springer-Verlag, 2008)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    We consider a model of reconfigurable robot, introduced and prototyped by the robotics community. The robot consists of independently manipulable unit-square atoms that can extend/contract arms on each side and attach/detach ...
  • Segmenting trajectories: A framework and algorithms using spatiotemporal criteria 

    Buchin, Maike; Driemel, Anne; Kreveld, Marc van; Sacristán Adinolfi, Vera (2011)
    Article
    Accés obert
    In this paper we address the problem of segmenting a trajectory based on spatiotemporal criteria. We require that each segment is homogeneous in the sense that a set of spatiotemporal criteria are fulfilled. We define ...