Ara es mostren els items 17-36 de 51

    • Matching points with diametral disks 

      Huemer, Clemens; Pérez-Lantero, Pablo; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio (2017)
      Text en actes de congrés
      Accés obert
      We consider matchings between a set R of red points and a set B of blue points with diametral disks. In other words, for each pair of matched points p ¿ R and q ¿ B, we consider the diametral disk defined by p and q. We ...
    • Matching points with disks with a common intersection 

      Huemer, Clemens; Pérez Lantero, Pablo; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio (2019-07-01)
      Article
      Accés obert
      We consider matchings with diametral disks between two sets of points R and B. More precisely, for each pair of matched points p ¿ R and q ¿ B, we consider the disk through p and q with the smallest diameter. We prove that ...
    • Matching points with things 

      Taslakian, Perouz; Seara Ojea, Carlos; Saumell Mendiola, Maria; Langerman, Stefan; Hurtado Díaz, Fernando Alfredo; Aloupis, Greg; Cardinal, Jean; Collette, Sébastien; Demaine, Erik D.; Demaine, Martin L.; Dulieu, Muriel; Fabila Monroy, Ruy; Hart, Vi (Springer Verlag, 2010)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      Given an ordered set of points and an ordered set of geometric objects in the plane, we are interested in finding a non-crossing matching between point-object pairs. We show that when the objects we match the points to ...
    • Matching random colored points with rectangles 

      Corujo, Josué; Flores Peñaloza, David; Huemer, Clemens; Seara Ojea, Carlos; Pérez Lantero, Pablo (Springer, 2020)
      Text en actes de congrés
      Accés obert
      Let S[0,1]2 be a set of n points, randomly and uniformly selected. Let RB be a random partition, or coloring, of S in which each point of S is included in R uniformly at random with probability 1/2. We study the random ...
    • Matching random colored points with rectangles 

      Corujo, Josué; Flores Peñazola, David; Huemer, Clemens; Pérez Lantero, Pablo; Seara Ojea, Carlos (Universitat de Girona, 2019)
      Comunicació de congrés
      Accés obert
      Let S ¿ [0, 1]2 be a set of n points, randomly and uniformly selected. Let R ¿ B be a random partition, or coloring, of S in which each point of S is included in R uniformly at random with probability 1/2. We study the ...
    • Maximum box problem on stochastic points 

      Caraballo, Luis E.; Pérez Lantero, Pablo; Seara Ojea, Carlos; Ventura, Inmaculada (Springer Nature, 2021-10-28)
      Article
      Accés obert
      Given a finite set of weighted points in Rd (where there can be negative weights), the maximum box problem asks for an axis-aligned rectangle (i.e., box) such that the sum of the weights of the points that it contains is ...
    • New results on stabbing segments with a polygon 

      Díaz Bañez, José Miguel; Korman Cozzetti, Matías; Pérez Lantero, Pablo; Pilz, Alexander; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio (Springer, 2013)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      We consider a natural variation of the concept of stabbing a segment by a simple polygon: a segment is stabbed by a simple polygon P if at least one of its two endpoints is contained in P. A segment set S is stabbed by P ...
    • New results on stabbing segments with a polygon 

      Díaz Bañez, José Miguel; Korman Cozzetti, Matías; Pérez Lantero, Pablo; Pilz, Alexander; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio (2015-01-01)
      Article
      Accés obert
      We consider a natural variation of the concept of stabbing a set of segments with a simple polygon: a segment s is stabbed by a simple polygon P if at least one endpoint of s is contained in P, and a segment set S is stabbed ...
    • On (a, k)-sets and (a, k)-hulls in the plane 

      Claverol Aguas, Mercè; Herrera Becerra, Luís Hernán; Seara Ojea, Carlos; Pérez Lantero, Pablo (2021)
      Text en actes de congrés
      Accés obert
      This abstract reports first the study of upper and lower bounds for the maximum number of all the combinatorially different (a, k)-sets of an n-point set P in the plane, 0 < a = p and 0 < 2k < n, depending on the ...
    • On computing enclosing isosceles triangles and related problems 

      Bose, Prosenjit; Mora Giné, Mercè; Seara Ojea, Carlos; Sethia, Saurabh (2011-02)
      Article
      Accés obert
      Given a set of n points in the plane, we show how to compute various enclosing isosceles triangles where different parameters such as area or perimeter are optimized. We then study a 3-dimensional version of the problem ...
    • On geodetic sets formed by boundary vertices 

      Cáceres González, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas González, María Luz; Seara Ojea, Carlos (2003)
      Article
      Accés obert
      Let G be a finite simple connected graph. A vertex v is a boundary vertex of G if there exists a vertex u such that no neighbor of v is further away from u than v. We obtain a number of properties involving different types ...
    • On Hamiltonian alternating cycles and paths 

      Claverol Aguas, Mercè; García, Alfredo; Garijo Royo, Delia; Seara Ojea, Carlos; Tejel, Javier (2018-03)
      Article
      Accés obert
      We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an intensively studied problem, not always with a solution, when the paths and cycles are also required to ...
    • On maximum-sum matchings of points 

      Bereg, Sergey; Chacón Rivera, Oscar; Flores Peñaloza, David; Huemer, Clemens; Pérez Lantero, Pablo; Seara Ojea, Carlos (Springer Nature, 2022-06-21)
      Article
      Accés obert
      Huemer et al. (Discrete Mathematics, 2019) proved that for any two point sets R and B with |R|=|B| , the perfect matching that matches points of R with points of B, and maximizes the total squared Euclidean distance of the ...
    • On maximum-sum matchings of points 

      Bereg, Sergey; Chacón Rivera, Oscar; Flores Peñaloza, David; Huemer, Clemens; Pérez Lantero, Pablo; Seara Ojea, Carlos (2021)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      Huemer et al. (Discrete Math., 2019) proved that for any two point sets R and B with |R| = |B|, the perfect matching that matches points of R with points of B, and maximizes the total squared Euclidean distance of the ...
    • On monophonic sets in graphs 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Seara Ojea, Carlos (2003)
      Report de recerca
      Accés obert
    • On the determining number and the metric dimension of graphs 

      Cáceres, Jose; Garijo, Delia; Puertas González, María Luz; Seara Ojea, Carlos (2010-04-19)
      Article
      Accés obert
      This paper initiates a study on the problem of computing the difference between the metric dimension and the determining number of graphs. We provide new proofs and results on the determining number of trees and Cartesian ...
    • On the Oß-hull of a planar point set 

      Alegría Galicia, Carlos; Orden, David; Seara Ojea, Carlos; Urrutia Galicia, Jorge (2018-03-01)
      Article
      Accés obert
      We study the Oß-hull of a planar point set, a generalization of the Orthogonal Convex Hull where the coordinate axes form an angle ß. Given a set P of n points in the plane, we show how to maintain the Oß-hull of P while ...
    • On the Steiner, geodetic and hull numbers of graphs 

      Hernando Martín, María del Carmen; Tao, Jiang; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Seara Ojea, Carlos (2003)
      Article
      Accés obert
      Given a graph G and a subset W ? V (G), a Steiner W-tree is a tree of minimum order that contains all of W. Let S(W) denote the set of all vertices in G that lie on some Steiner W-tree; we call S(W) the Steiner interval ...
    • Optimizing generalized kernels of polygons 

      Martínez Moraian, Alejandra; Orden Martin, David; Palios, Leonidas; Seara Ojea, Carlos; Zylinski, Pawel (Springer Nature, 2021-04-09)
      Article
      Accés obert
      Let O be a set of k orientations in the plane, and let P be a simple polygon in the plane. Given two points p, q inside P, we say that p O-sees q if there is an O-staircase contained in P that connects p and q. The O-Kernel ...
    • Production matrices for geometric graphs 

      Huemer, Clemens; Pilz, Alexander; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio (2016)
      Article
      Accés obert
      We present production matrices for non-crossing geometric graphs on point sets in convex position, which allow us to derive formulas for the numbers of such graphs. Several known identities for Catalan numbers, Ballot ...