Browsing by Author "Korman Cozzetti, Matías"

Now showing items 1-16 of 16

    • Cell-paths in mono- and bichromatic line arrangements in the plane 

      Aichholzer, Oswin; Cardinal, Jean; Hackl, Thomas; Hurtado Díaz, Fernando Alfredo; Korman Cozzetti, Matías; Pilz, Alexander; Silveira, Rodrigo Ignacio; Uehara, Ryuhei; Vogtenhuber, Birgit; Welzl, Emo (2014)
      Conference report
      Open Access
      We show that in every arrangement of n red and blue lines | in general position and not all of the same color | there is a path through a linear number of cells where red and blue lines are crossed alternatingly (and no ...

    • 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 ...

    • Computing a visibility polygon using few variables 

      Barba, Luis; Korman Cozzetti, Matías; Langerman, Stefan; Silveira, Rodrigo Ignacio (2014-10-01)
      Article
      Restricted access - publisher's policy
      We present several algorithms for computing the visibility polygon of a simple polygon P of n vertices (out of which r are reflex) from a viewpoint inside P, when P resides in read-only memory and only few working variables ...

    • Geodesic order types 

      Aichholzer, Oswin; Korman Cozzetti, Matías; Pilz, Alexander; Vogtenhuber, Birgit (2014-09-01)
      Article
      Restricted access - publisher's policy
      The geodesic between two points a and b in the interior of a simple polygon P is the shortest polygonal path inside P that connects a to b. It is thus the natural generalization of straight line segments on unconstrained ...

    • Geometric biplane graphs I: maximal graphs 

      Hurtado Díaz, Fernando Alfredo; Garcia Olaverri, Alfredo Martin; Korman Cozzetti, Matías; Matos, Inés P.; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Tóth, Csaba D. (2013)
      Conference report
      Open Access

    • Geometric biplane graphs I: maximal graphs 

      Garcia Olaverri, Alfredo Martin; Hurtado Díaz, Fernando Alfredo; Korman Cozzetti, Matías; Matos, Inés P.; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Tóth, Csaba D. (2015-03-01)
      Article
      Open Access
      We study biplane graphs drawn on a finite planar point set in general position. This is the family of geometric graphs whose vertex set is and can be decomposed into two plane graphs. We show that two maximal biplane ...

    • Geometric biplane graphs II: graph augmentation 

      Garcia Olaverri, Alfredo Martin; Hurtado Díaz, Fernando Alfredo; Korman Cozzetti, Matías; Matos, Inés P.; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Tóth, Csaba D. (2015-03-01)
      Article
      Open Access
      We study biplane graphs drawn on a finite point set in the plane in general position. This is the family of geometric graphs whose vertex set is and which can be decomposed into two plane graphs. We show that every ...

    • Geometric Biplane Graphs II: Graph Augmentation 

      Hurtado Díaz, Fernando Alfredo; Garcia Olaverri, Alfredo Martin; Korman Cozzetti, Matías; Matos, Inés P.; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Tóth, Csaba D. (2013)
      Conference report
      Open Access
      We study biplane graphs drawn on a nite point set S in the plane in general position. This is the family of geometric graphs whose vertex set is S and which can be decomposed into two plane graphs. We show that every ...

    • Graphs with large total angular resolution 

      Aichholzer, Oswin; Korman Cozzetti, Matías; Okamoto, Yoshio; Parada Muñoz, Irene María de; Perz, Daniel; van Renssen, Andre; Vogtenhuber, Birgit (2023-01-17)
      Article
      Open Access
      The total angular resolution of a straight-line drawing is the minimum angle between two edges of the drawing. It combines two properties contributing to the readability of a drawing: the angular resolution, which is the ...

    • Locating a service facility and a rapid transit line 

      Díaz Bañez, José Miguel; Korman Cozzetti, Matías; Pérez Lantero, Pablo; Ventura, Immaculada (Springer, 2011)
      Conference report
      Restricted access - publisher's policy
      In this paper we study a facility location problem in the plane in which a single point (facility) and a rapid transit line (highway) are simultaneously located in order to minimize the total travel time of the clients to ...

    • Minimizing interference in ad hoc networks with bounded communication radius 

      Korman Cozzetti, Matías (2012-10-15)
      Article
      Restricted access - publisher's policy
      We consider a topology control problem in which we are given a set of sensors in RdRd and we would like to assign a communication radius to each of them so that they generate a connected network and have low receiver-based ...

    • 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)
      Conference report
      Restricted access - publisher's policy
      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
      Open Access
      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 ...

    • The 1-Center and 1-Highway Problem 

      Díaz Bañez, José Miguel; Korman Cozzetti, Matías; Pérez Lantero, Pablo; Ventura, Immaculada (Springer, 2011)
      Conference report
      Restricted access - publisher's policy
      In this paper we extend the Rectilinear 1-center as follows: Given a set S of n points in the plane, we are interested in locating a facility point f and a rapid transit line (highway) H that together minimize the expression ...

    • The 1-median and 1-highway problem 

      Díaz Bañez, José Miguel; Korman Cozzetti, Matías; Pérez Lantero, Pablo; Ventura, Inmaculada (Elsevier, 2013-03-16)
      Article
      Restricted access - publisher's policy
      In this paper we study a facility location problem in the plane in which a single point (median) and a rapid transit line (highway) are simultaneously located in order to minimize the total travel time of the clients to ...

    • The geodesic diameter of polygonal domains 

      Bae, SangWon; Korman Cozzetti, Matías; Okamoto, Yoshio (2013-09)
      Article
      Restricted access - publisher's policy
      This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simple polygons (i.e., h = 0), the geodesic diameter is determined by a pair of corners of a given polygon and can be computed ...