Now showing items 1-5 of 5

    • Article
      Icon

      Compatible Geometric Matchings 

      Aichholzer, Oswin; Bereg, Sergey; Dumitrescu, Adrian; García Olaverri, Alfredo; Huemer, Clemens; Hurtado, Ferrán; Kano, Mikio; Márquez Pérez, Alberto; Rappaport, David; Smorodinsky, Shakhar; Souvaine, Diane L.; Urrutia, Jorge; Wood, David R. (2008)
    • Presentation
      Icon

      Note on the number of obtuse angles in point sets 

      Fabila Monroy, Ruy; Huemer, Clemens; Tramuns Figueras, Eulàlia (2013)
      In 1979 Conway, Croft, Erd\H{o}s and Guy proved that every set SS of nn points in general position in the plane determines ...
    • Presentation
      Icon

      On 4-connected geometric graphs 

      García Olaverri, Alfredo; Huemer, Clemens; Tejel Altarriba, Francisco Javier; Valtr, Pavel (2013)
      Given a set S of n points in the plane, in this paper we give a necessary and sometimes sufficient condition to build a 4-connected non-crossing geometric graph on S.
    • Presentation
      Icon

      On some partitioning problems for two-colored point sets 

      Grima Ruiz, Clara Isabel; Hernando Martín, Carmen; Huemer, Clemens; Hurtado Díaz, Ferran (Prensas de la Universidad de Zaragoza, 2009)
      Let S be a two-colored set of n points in general position in the plane. We show that S admits at least 2 n 17 ...
    • Presentation
      Icon

      Triangulations without pointed spanning trees 

      Aichholzer, Oswin; Huemer, Clemens; Krasser, Hannes (2004)
      Problem 50 in the Open Problems Project asks whether any triangulation on a point set in the plane contains a pointed ...