Now showing items 21-30 of 30

    • Map construction algorithms: an evaluation through hiking data 

      Duran, David; Sacristán Adinolfi, Vera; Silveira, Rodrigo Ignacio (Association for Computing Machinery (ACM), 2017)
      Conference report
      Restricted access - publisher's policy
      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
      Open Access
      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)
      Conference report
      Open Access
      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)
      Conference report
      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 ...
    • 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)
      Conference report
      Restricted access - publisher's policy
      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
      Open Access
      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 ...
    • Shortest coordinated motion for square robots 

      Esteban Pascual, Guillermo; Halperin, Dan; Ruíz, Víctor; Sacristán Adinolfi, Vera; Silveira, Rodrigo Ignacio (Springer, 2023)
      Conference report
      Restricted access - publisher's policy
      We study the problem of determining minimum-length coordinated motions for two axis-aligned square robots translating in an obstacle-free plane: Given feasible start and goal configurations, find a continuous motion for ...
    • Some properties of higher order delaunay and gabriel graphs 

      Bose, Prosenjit; Collette, Sébastien; Hurtado Díaz, Fernando Alfredo; Korman, Matias; Langerman, Stefan; Sacristán Adinolfi, Vera; Saumell Mendiola, Maria (2010)
      Conference report
      Open Access
      We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the following combinatorial and geometric properties ...
    • Terrain visibility with multiple viewpoints 

      Hurtado Díaz, Fernando Alfredo; Löffler, Maarten; Matos, Inés P.; Sacristán Adinolfi, Vera; Saumell, Maria; Silveira, Rodrigo Ignacio; Staals, Frank (Springer, 2013)
      Conference report
      Open Access
      We study the problem of visibility in polyhedral terrains in the presence of multiple viewpoints. We consider three fundamental visibility structures: the visibility map, the colored visibility map, and the Voronoi visibility ...
    • Widening the analysis of Energy Return On Investment (EROI) in agroecosystems: A proposal to study socio-ecological transitions to industrialized farm systems (the Vallès County, Catalonia, c.1860 and 1999) 

      Galán, E.; Padró, R.; Marco, I.; Tello Aragay, Enric; Cunfer, G.; Guzmán, G. I.; González de Molina, M.; Krausmann, F.; Gingrich, S.; Sacristán Adinolfi, Vera; Moreno-Delgado, D. (2016)
      Article
      Open Access
      Energy balances of farm systems have overlooked the role of energy flows that remain within agro-ecosystems. Yet, such internal flows fulfil important socio-ecological functions, including maintenance of farmers themselves ...