• DocumentCode
    2059192
  • Title

    Study on Art Gallery Based on 4-coloring

  • Author

    Kelun, Wang ; Hongxiang, Ren ; Shuang, Wang

  • Author_Institution
    Math. Dept., Dalian Maritime Univ., Dalian, China
  • fYear
    2009
  • fDate
    11-14 Aug. 2009
  • Firstpage
    255
  • Lastpage
    258
  • Abstract
    It isn´t the best result on the art gallery based on the 3-coloring in resolving the most of simple polygons, through a analysis of the simple polygon triangulation in the relationship between adjacent triangles, using the dual relation between triangulation and binary tree, this paper puts a forward 4-coloring on the polygon triangulation, and analyze and research the case which has been 4-coloring. we can obtain some results that the condition of any type of colors could cover the whole polygon, and the condition that at least one type of colors could cover the whole polygon (namely the art gallery only need for monitors), we also analyzing the reason which failed to cover the whole polygon, and presenting the condition which couldn´t be 4-colored.
  • Keywords
    computational geometry; graph colouring; trees (mathematics); 4-coloring method; art gallery problem; binary tree; computational geometry; graph coloring; planar triangulated simple polygon; polygon triangulation; Art; Binary trees; Computer graphics; Failure analysis; Image analysis; Image color analysis; Image resolution; Laboratories; Mathematics; Visualization; 4-coloring; art gallery;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Graphics, Imaging and Visualization, 2009. CGIV '09. Sixth International Conference on
  • Conference_Location
    Tianjin
  • Print_ISBN
    978-0-7695-3789-4
  • Type

    conf

  • DOI
    10.1109/CGIV.2009.25
  • Filename
    5298885