• DocumentCode
    545448
  • Title

    Algorithm design of lighting uniformity problem for large venue

  • Author

    Lei Peng ; Gao Hongjiang

  • Author_Institution
    Sch. of Inf. Sci. & Eng., Ludong Univ., Yantai, China
  • Volume
    2
  • fYear
    2011
  • fDate
    11-13 March 2011
  • Firstpage
    415
  • Lastpage
    418
  • Abstract
    Formal definition of lighting uniformity problem is presented, and a corresponding computational model is then put forward in this paper. After a logical data structure is designed, an efficient polynomial time algorithm is proposed on the basis of the geometry symmetric characteristic of this problem. The mount plane is divided equally into four sections, on which four luminaries are mounted symmetrically at the same time. The optimal positions are figured out to obtain a preferable design scheme. Analysis of application instances for large venue shows that our scheme increases the lighting uniformity by an average of 30 percent, compared with normal methods, and thus achieves the international standards.
  • Keywords
    brightness; computational complexity; data structures; lighting; optical engineering computing; computational model; formal definition; geometry symmetric characteristic; large venue; lighting uniformity problem; logical data structure; mount plane; polynomial time algorithm; Algorithm design and analysis; Computational modeling; Data structures; Light sources; Lighting; Presses; Standards; algorithm; illuminance; lighting uniformity; venue;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Research and Development (ICCRD), 2011 3rd International Conference on
  • Conference_Location
    Shanghai
  • Print_ISBN
    978-1-61284-839-6
  • Type

    conf

  • DOI
    10.1109/ICCRD.2011.5764163
  • Filename
    5764163