Exploració per autor "Hurtado Díaz, Fernando Alfredo"Més informacióMés informació

Ara es mostren els items 58-67 de 67

    • 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)
      Text en actes de congrés
      Accés obert
      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 ...

    • Stabbing simplices of point sets with k-flats 

      Cano, Javier; Hurtado Díaz, Fernando Alfredo; Urrutia Galicia, Jorge (Universidad de Sevilla, 2013)
      Text en actes de congrés
      Accés obert
      Let S be a set of n points inRdin general position.A set H of k-flats is called an mk-stabber of S if the relative interior of anym-simplex with vertices in S is intersected by at least one element of H. In thispaper we ...

    • 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)
      Text en actes de congrés
      Accés obert
      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 ...

    • The alternating path problem revisited 

      Claverol Aguas, Mercè; Garijo, Delia; Hurtado Díaz, Fernando Alfredo; Lara Cuevas, María Dolores; Seara Ojea, Carlos (Universidad de Sevilla, 2013)
      Text en actes de congrés
      Accés obert
      It is well known that, given "n" red points and "n" blue points on acircle, it is not always possible to find a plane geometric. Hamiltonian alternating path. In this work we prove that if we relax the constraint on the ...

    • The rotation graph of k-ary trees is Hamiltonian 

      Huemer, Clemens; Hurtado Díaz, Fernando Alfredo; Pfeifle, Julián (Crete University Press, 2006)
      Article
      Accés restringit per política de l'editorial
      In this paper we show that the graph of k-ary trees, connected by rotations, contains a Hamilton cycle. Our proof is constructive and thus provides a cyclic Gray code for k-ary trees. Furthermore, we identify a basic ...

    • Two-convex polygons 

      Aichholzer, Oswin; Aurenhammer, Franz; Hurtado Díaz, Fernando Alfredo; Ramos, Pedro A.; Urrutia, J. (Université Libre de Bruxelles, 2009)
      Text en actes de congrés
      Accés obert
      We introduce a notion of k-convexity and explore some properties of polygons that have this property. In particular, 2-convex polygons can be recognized in O(n log n) time, and k-convex polygons can be triangulated in O(kn) time.

    • Universal point subsets for planar graphs 

      Angelini, Patrizio; Binucci, Carla; Evans, William; Hurtado Díaz, Fernando Alfredo; Liotta, Giuseppe; Mchedlidze, Tamara; Meijer, Henk; Okamoto, Yoshio (Springer, 2012)
      Text en actes de congrés
      Accés obert
      A set S of k points in the plane is a universal point subset for a class G of planar graphs if every graph belonging to G admits a planar straight-line drawing such that k of its vertices are represented by the points of ...

    • Witness bar visibility graphs 

      Cortés, Carmen; Hurtado Díaz, Fernando Alfredo; Márquez, Alberto; Valenzuela, Jesús (2013)
      Text en actes de congrés
      Accés obert
      Bar visibility graphs were introduced in the seventies as a model for some VLSI layout problems. They have been also studied since then by the graph drawing community, and recently several generalizations and restricted ...

    • Witness gabriel graphs 

      Aronov, Boris; Dulieu, Muriel; Hurtado Díaz, Fernando Alfredo (2009)
      Text en actes de congrés
      Accés obert
      We consider a generalization of the Gabriel graph, the witness Gabriel graph. Given a set of vertices P and a set of witness points W in the plane, there is an edge ab between two points of P in the witness Gabriel graph ...

    • Witness rectangle graphs 

      Aronov, Boris; Dulieu, Muriel; Hurtado Díaz, Fernando Alfredo (2014-07)
      Article
      Accés restringit per política de l'editorial
      In a witness rectangle graph (WRG) on vertex point set P with respect to witness point set W in the plane, two points x, y in P are adjacent whenever the open isothetic rectangle with x and y as opposite corners contains ...