• DocumentCode
    3450416
  • Title

    Lovasz´s lemma for the three-dimensional K-level of concave surfaces and its applications

  • Author

    Katoh, Naoki ; Tokuyama, Takeshi

  • Author_Institution
    Fac. of Eng., Kyoto Univ., Japan
  • fYear
    1999
  • fDate
    1999
  • Firstpage
    389
  • Lastpage
    398
  • Abstract
    We show that for any line l in space, there are at most k(k+1) tangent planes through l to the k-level of an arrangement of concave surfaces. This is a generalization of L. Lovasz´s (1971) lemma, which is a key constituent in the analysis of the complexity of k-level of planes. Our proof is constructive, and finds a family of concave surfaces covering the “laminated at-most-k level”. As consequences, (1): we have an O((n-k)2/3n2) upper bound for the complexity of the k-level of n triangle of space, and (2): we can extend the k-set result in space to the k-set of a system of subsets of n points
  • Keywords
    combinatorial mathematics; computational complexity; geometry; Lovasz lemma; complexity; concave surfaces; constructive proof; k-set result; laminated at-most-k level; subsets; tangent planes; three-dimensional K-level; Geometry; Laboratories; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1999. 40th Annual Symposium on
  • Conference_Location
    New York City, NY
  • ISSN
    0272-5428
  • Print_ISBN
    0-7695-0409-4
  • Type

    conf

  • DOI
    10.1109/SFFCS.1999.814610
  • Filename
    814610