---

VG95.cxx

Go to the documentation of this file.

/*
 * @(#)src/VG95.cxx  1.0  2002-09-07 09:52
 *
 * Copyright (C)  2002  Daniel Léonard
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 */

#include <utility>
#include "Image.h"
#include "SFCPath.h"
#include "SFCPathFactory.h"
#include "VG95.h"
#include "VGSpec.h"

namespace halftoner
{

//---------------------------
// Constructor
//---------------------------

   VG95::VG95() throw()
   {
   // nothing
   }


//---------------------------
// Destructor
//---------------------------

   VG95::~VG95()
   {
   // nothing
   }


//---------------------------
// Implemented method from Halftoner
//---------------------------

   Image* VG95::halftone(const Image& source, const HalftonerSpec* spec) throw (std::invalid_argument)
   {
   // dimensions
      const int width = source.getWidth();
      const int height = source.getHeight();
   // square check
      if (width != height)
      {
         string s("image is not square");
         throw std::invalid_argument(s);
      }

   // getting the curve (can throw std::invalid_argument)
      const VGSpec* vgspec = dynamic_cast<const VGSpec*>(spec);
      int cluster = vgspec->getClusterSize();
      const SFCPathFactory::SizeMnemonic& mnemonic = vgspec->getMnemonic();
      SFCPath* curve = SFCPathFactory::getInstance(mnemonic);

   // destination image
      Image* out = new Image(width, height);
   // needed variables
      int accumulator = 0;
      int len = width * height;
      std::pair<int, int> maxblack; maxblack.first = 0; maxblack.second = 255;
      int grey;
      std::pair<int, int> p;
      int black;
      int step;
   // here we go
      for (int i = 0; i < len; i += cluster)
      {
      // accumulator
         for (int n = 0; n < cluster; n++)
         {
            if (i + n < len)
            {
            // coordinates
               p = (*curve)[i + n];
            // colour
               grey = source.getColorAt(p.first, p.second);
            // accumulation
               accumulator += grey;
            // index
               if (maxblack.second > grey)
               {
                  maxblack.first = i + n;
                  maxblack.second = grey;
               }
            // all cluster pixels to white
               out->setColorAt(p.first, p.second, 1);
            }
         }
      // finding how many black pixels
         black = cluster;
         step = len - i;
         if (black > step) black = step;
         while (accumulator >= 255)
         {
            black--;
            accumulator -=255;
         }
      // distributing black pixels
         if (black > 0)
         {
            p = (*curve)[maxblack.first];
            out->setColorAt(p.first, p.second, 0);
            black--;
         }
         int pos;
         for (int n = 1; i + n < len; n++)
         {
         // checking invariants
            if (black == 0) break;
         // to the left
            pos = maxblack.first - n;
            if (pos >= i)
            {
               p = (*curve)[pos];
               out->setColorAt(p.first, p.second, 0);
               black--;
            }
            // we hit the edge of the cluster
            else
            {
               while (black > 0)
               {
                  pos = maxblack.first + n; n++;
                  p = (*curve)[pos];
                  out->setColorAt(p.first, p.second, 0);
                  black--;
               }
               break;
            }
         // checking invariants
            if (black == 0) break;
         // to the right
            pos = maxblack.first + n;
            if (pos < (i + cluster))
            {
               p = (*curve)[pos];
               out->setColorAt(p.first, p.second, 0);
               black--;
            }
            // we hit the edge of the cluster
            else
            {
               while (black > 0)
               {
                  n++; pos = maxblack.first - n;
                  p = (*curve)[pos];
                  out->setColorAt(p.first, p.second, 0);
                  black--;
               }
               break;
            }
         }
      // reset index
         maxblack.first = 0; maxblack.second = 255;
      }
      delete curve;
      return out;
   }

}

---