• DocumentCode
    1598755
  • Title

    Optimize Geometry Division to Construct Clustered Dot Dithering Matrix

  • Author

    Guoliang, Xu ; Qingping, Tan

  • Author_Institution
    Comput. Coll., Nat. Univ. of Defense Sci. & Technol., Changsha, China
  • Volume
    1
  • fYear
    2010
  • Firstpage
    414
  • Lastpage
    417
  • Abstract
    The indirect approach to construct clustered dot dithering matrix has 3 steps: 1. having clustered dot center; 2. calculate the geometry division of the halftone plane by taking the centers as point set; 3. make dithering matrix. According to the existing related research work, it usually makes the center of each face of the division as the centre of clustered dot for shadow. The vertex of the division will be the center of clustered dot for highlight. In the dithering matrix produced with above method, the clustered dot density for shadow and highlight may have big difference. To make clustered dot density for shadow and highlight balanced, an optimize algorithm based on two theorems deducted from Euler theorem is proposed. In the experiment with the algorithm, ratio between the clustered dot density for shadow and highlight are improved to 0.90392 from original 0.50220.
  • Keywords
    computational geometry; image resolution; mesh generation; pattern clustering; Delaunay triangulation; Euler theorem; Voronoi diagram; clustered dot center; clustered dot density; clustered dot dithering matrix; image resolution; indirect approach; optimize algorithm; Clustering algorithms; Educational institutions; Geometry; Image converters; Matrix converters; Pixel; Printing; Shape; Solid modeling; Space technology; Delaunay Triangulation; Delaunay TriangulationHalftone; Dithering Matrix; Halftone; Hybrid Halftone; Voronoi Diagram;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Modeling and Simulation, 2010. ICCMS '10. Second International Conference on
  • Conference_Location
    Sanya, Hainan
  • Print_ISBN
    978-1-4244-5642-0
  • Electronic_ISBN
    978-1-4244-5643-7
  • Type

    conf

  • DOI
    10.1109/ICCMS.2010.141
  • Filename
    5421357