Now showing items 1-20 of 30

    • A new meta-module design for efficient reconfiguration of modular robots 

      Parada, Irene; Sacristán Adinolfi, Vera; Silveira, Rodrigo Ignacio (Springer Nature, 2021-05-01)
      Article
      Open Access
      We propose a new meta-module design for two important classes of modular robots. The new metamodule is three-dimensional, robust and compact, improving on the previously proposed one. It applies to socalled “edge-hinged” ...
    • 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)
      Conference report
      Open Access
      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 note on flips in diagonal rectangulations 

      Cardinal, Jean; Sacristán Adinolfi, Vera; Silveira, Rodrigo Ignacio (Chapman & Hall/CRC, 2018-11-09)
      Article
      Open Access
      Rectangulations are partitions of a square into axis-aligned rectangles. A number of results provide bijections between combinatorial equivalence classes of rectangulations and families of pattern-avoiding permutations. ...
    • 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
      Open Access
      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 ...
    • 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)
      Conference report
      Restricted access - publisher's policy
      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 ...
    • 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 anchored visibility representations in 2D and 3D space 

      Binucci, Carla; Di Giacomo, Emilio; Hong, Seok-Hee; Liotta, Giuseppe; Meijer, Henk; Sacristán Adinolfi, Vera; Wismath, Stephen (2020-08)
      Article
      Open Access
      In a visibility representation of a graph G, the vertices are represented by nonoverlapping geometric objects, while the edges are represented as segments that only intersect the geometric objects associated with their ...
    • 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
      Open Access
      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)
      Conference report
      Open Access
      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)
      Conference report
      Restricted access - publisher's policy
      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 ...
    • Development of algebraic specifications with constraints 

      Orejas Valdés, Fernando; Sacristán Adinolfi, Vera; Clérici Martínez, Silvia Inés (1989)
      Research report
      Open Access
      A formal framework for the development of algebraic specifications is presented. Ther main issues concerning the approach are the following: we allow to deal with incomplete specifications during the design process. This ...
    • 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)
      Conference report
      Open Access
      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
      Open Access
      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)
      Book
      Open Access
      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
      Open Access
    • 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
      Open Access
      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 ...
    • Farthest color Voronoi diagrams: complexity and algorithms 

      Mantas, Ioannis; Papadopoulou, Evanthia; Sacristán Adinolfi, Vera; Silveira, Rodrigo Ignacio (Springer, 2021)
      Conference report
      Restricted access - publisher's policy
      The farthest-color Voronoi diagram (FCVD) is a farthestsite Voronoi structure defined on a family P of m point-clusters in the plane, where the total number of points is n. The FCVD finds applications in problems related ...
    • 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
      Open Access
      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
      Open Access
    • Map construction algorithms: a local evaluation through hiking data 

      Duran, David; Sacristán Adinolfi, Vera; Silveira, Rodrigo Ignacio (2020-02-26)
      Article
      Open Access
      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 ...