Akademska digitalna zbirka SLovenije - logo
ALL libraries (COBIB.SI union bibliographic/catalogue database)
  • Computing a center-transversal line
    Cabello, Sergio ; Sellarès, J. Antoni
    A center-transversal line for two finite point sets in three dimensions is a line with the property that any closed halfspace that contains it has at least one third of each poit set inside. A center ... transversal line always exists, and we provide an algorithm that finds a center-transversal line in ▫$O(n^8)$▫ worst-case time. Algorithms that describe all center-transversal lines, find a deepest line, and find an almost-deepest line are also presented.
    Source: XI Encuentros de Geometría Computacional : Santander, del 27 al 29 de junio de 2005 (Str. 133-140)
    Type of material - conference contribution
    Publish date - 2005
    Language - english
    COBISS.SI-ID - 13614425

Shelf entry