• Monocular depth ordering using T-Junctions and convexity occlusion cues 

      Palou Visa, Guillem; Salembier Clairon, Philippe Jean (2013)
      Article
      Accés restringit per política de l'editorial
      This paper proposes a system that relates objects in an image using occlusion cues and arranges them according to depth. The system does not rely on a priori knowledge of the scene structure and focuses on detecting ...
    • Two-convex polygons 

      Aichholzer, Oswin; Aurenhammer, Franz; Hurtado Díaz, Fernando Alfredo; Ramos, Pedro A.; Urrutia, J. (Université Libre de Bruxelles, 2009)
      Text en actes de congrés
      Accés obert
      We introduce a notion of k-convexity and explore some properties of polygons that have this property. In particular, 2-convex polygons can be recognized in O(n log n) time, and k-convex polygons can be triangulated in O(kn) time.