Now showing items 1-7 of 7

    • Algorithmic geometry with infinite time computation 

      Tobar Nicolau, Adrian (Universitat Politècnica de Catalunya, 2020-07)
      Master thesis
      Open Access
      In this project we do an algorithmic study of problems from computational geometry with countably infinite input, especially countable sets in R^n. To do so, we use the infinite time Blum-Shub-Smale (ITBSS) machine, which ...
    • Ángulos obtusos en conjuntos de puntos: un problema de geometría combinatoria 

      Gasparino Benitez, J.Bautista (Universitat Politècnica de Catalunya, 2013-07-04)
      Bachelor thesis
      Restricted access - author's decision
      This project treats a classic problem in combinatorial geometry: the study of obtuse angles (angles larger than pi/2 radians) in a set of points on the plane. The main question is: What is the minimum number of obtuse ...
    • Combinatorial properties of convex polygons in point sets 

      Torra Clotet, Ferran (Universitat Politècnica de Catalunya, 2019-07)
      Master thesis
      Open Access
      The Erdős-Szekeres theorem is a famous result in Discrete geometry that inspired a lot of research and motivated new problems. The theorem states that for every integer n ≥ 3 there is another integer N_0 such ...
    • Contaje de triángulos en conjuntos de puntos coloreados: un problema de la geometría combinatoria 

      Font Cipres, Luis; Alcalde Trias, Javier (Universitat Politècnica de Catalunya, 2013-05-14)
      Bachelor thesis
      Open Access
      A classical object of study in combinatorial geometry are sets S of points in the plane. A triangle with vertices from S is called empty if it contains no points of S in its interior. The number of empty triangles depends ...
    • Monte carlo methods for the rectilinear crossing number 

      Zheng, Shutao (Universitat Politècnica de Catalunya, 2016-07-26)
      Bachelor thesis
      Open Access
      The thesis is dedicated to find a fast Monte Carlo algorithm for the calculation of the rectilinear crossing number Cr(S) of a point set S in the plane, where Cr(S) is the number of intersections of all the straight ...
    • Production matrices and enumeration of geometric graphs 

      Esteban Pascual, Guillermo (Universitat Politècnica de Catalunya, 2018-07)
      Master thesis
      Open Access
      We propose the study of counting problems for geometric graphs defined on point sets in convex position. Many formulae are known, for instance the numbers of triangulations are given by the Catalan numbers. Our approach ...
    • Visualització de xarxes - Dibuixos de rectangles d'influència per a grafs bipartits planars 

      Sanmartí Bosch, Aida (Universitat Politècnica de Catalunya, 2012-07-05)
      Bachelor thesis
      Restricted access - author's decision
      Este trabajo se sitúa en el ámbito de Graph Drawing. Los grafos describen relaciones entre objetos y muchas redes que surgen en la práctica se modelan con grafos. El estudio de propiedades de grafos es una de las ramas ...