Exploració per tema "Computational Geometry"

Ara es mostren els items 1-3 de 3

    • Algorithmic geometry with infinite time computation 

      Tobar Nicolau, Adrián (Universitat Politècnica de Catalunya, 2020-07)
      Projecte Final de Màster Oficial
      Accés obert
      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 ...

    • Generalisation of Sylvester's problem 

      Monserrat Companys, Joaquim (Universitat Politècnica de Catalunya, 2015-09)
      Treball Final de Grau
      Accés obert
      Let $P$ be a set of $n$ points in the projective space of dimension $d$ with the property that not all the points are contained in an hyperplane and any $d$ points span an hyperplane. Let an ordinary hyperplane of $P$ be ...

    • On sets of points with few ordinary hyperplanes 

      Jiménez Izquierdo, Enrique (Universitat Politècnica de Catalunya, 2018-07)
      Projecte Final de Màster Oficial
      Accés obert
      Let $S$ be a set of $n$ points in the projective $d$-dimensional real space $\mathbb{RP}^d$ such that not all points of $S$ are contained in a single hyperplane and such that any subset of $d$ points of $S$ span a hyperplane. ...