#ifdef HAVE_CONFIG_H

# include <config.h>

#endif

#if GLIBMM_DISABLE_DEPRECATED && HAVE_GLIBMM_THREADS_H

#include <glibmm/threads.h>

#endif

#include <utility>

#include <algorithm>

#include "kopftracer2011.h"

#include "priv/colorspace.h"

#include "priv/homogeneoussplines.h"

#include "priv/branchless.h"

#include "priv/splines-kopf2011.h"

#include "priv/iterator.h"

namespace Tracer {

namespace Heuristics {

int curves(const PixelGraph &graph, PixelGraph::const_iterator a,

PixelGraph::const_iterator b);

bool islands(PixelGraph::const_iterator a, PixelGraph::const_iterator b);

struct SparsePixels

{

enum Diagonal {

/**

MAIN_DIAGONAL = 0,

/**

SECONDARY_DIAGONAL = 1

};

typedef std::pair<PixelGraph::const_iterator, PixelGraph::const_iterator>

Edge;

typedef std::pair<Edge, int> EdgeWeight;

void operator()(const PixelGraph &graph, unsigned radius);

static bool similar_colors(PixelGraph::const_iterator n,

const guint8 (&a)[4], const guint8 (&b)[4]);

/*

EdgeWeight diagonals[2];

};

} // namespace Heuristics

Splines Kopf2011::to_voronoi(const std::string &filename,

const Options &options)

{

return to_voronoi(Gdk::Pixbuf::create_from_file(filename), options);

}

Splines Kopf2011::to_voronoi(const Glib::RefPtr<Gdk::Pixbuf const> &buf,

const Options &options)

{

return Splines(_voronoi<Precision, false>(buf, options));

}

Splines Kopf2011::to_splines(const std::string &filename,

const Options &options)

{

return to_splines(Gdk::Pixbuf::create_from_file(filename), options);

}

Splines Kopf2011::to_splines(const Glib::RefPtr<Gdk::Pixbuf const> &buf,

const Options &options)

{

HomogeneousSplines<Precision> splines(_voronoi<Precision, true>

(buf, options));

return Splines(splines, options.optimize, options.nthreads);

}

template<class T, bool adjust_splines>

SimplifiedVoronoi<T, adjust_splines>

Kopf2011::_voronoi(const Glib::RefPtr<Gdk::Pixbuf const> &buf,

const Options &options)

{

PixelGraph graph(buf);

/*if ( !graph.width() || !graph.height() )

#ifndef NDEBUG

graph.checkConsistency();

#endif

// This step could be part of the initialization of PixelGraph

// and decrease the necessary number of passes

graph.connectAllNeighbors();

#ifndef NDEBUG

graph.checkConsistency();

#endif

// This step can't be part of PixelGraph initilization without adding some

// cache misses due to random access patterns that might be injected

_disconnect_neighbors_with_dissimilar_colors(graph);

#ifndef NDEBUG

graph.checkConsistency();

#endif

// This and below steps must be executed in separate.

// Otherwise, there will be colateral effects due to misassumption about the

// data being read.

_remove_crossing_edges_safe(graph);

#ifndef NDEBUG

graph.checkConsistency();

#endif

_remove_crossing_edges_unsafe(graph, options);

#ifndef NDEBUG

graph.checkConsistency();

#endif

return SimplifiedVoronoi<T, adjust_splines>(graph);

}

inline void

Kopf2011::_disconnect_neighbors_with_dissimilar_colors(PixelGraph &graph)

{

using colorspace::similar_colors;

for ( PixelGraph::iterator it = graph.begin(), end = graph.end() ; it != end

; ++it ) {

if ( it->adj.top )

it->adj.top = similar_colors(it->rgba, (it - graph.width())->rgba);

if ( it->adj.topright ) {

it->adj.topright

= similar_colors(it->rgba, (it - graph.width() + 1)->rgba);

}

if ( it->adj.right )

it->adj.right = similar_colors(it->rgba, (it + 1)->rgba);

if ( it->adj.bottomright ) {

it->adj.bottomright

= similar_colors(it->rgba, (it + graph.width() + 1)->rgba);

}

if ( it->adj.bottom ) {

it->adj.bottom

= similar_colors(it->rgba, (it + graph.width())->rgba);

}

if ( it->adj.bottomleft ) {

it->adj.bottomleft

= similar_colors(it->rgba, (it + graph.width() - 1)->rgba);

}

if ( it->adj.left )

it->adj.left = similar_colors(it->rgba, (it - 1)->rgba);

if ( it->adj.topleft ) {

it->adj.topleft = similar_colors(it->rgba,

(it - graph.width() - 1)->rgba);

}

}

}

inline void Kopf2011::_remove_crossing_edges_safe(PixelGraph &graph)

{

if ( graph.width() < 2 || graph.height() < 2 )

return;

PixelGraph::iterator it = graph.begin();

for ( int i = 0 ; i != graph.height() - 1 ; ++i, ++it ) {

for ( int j = 0 ; j != graph.width() - 1 ; ++j, ++it ) {

// this <-> right

if ( !it->adj.right )

continue;

// this <-> down

if ( !it->adj.bottom )

continue;

PixelGraph::iterator down_right = it + graph.width() + 1;

// down_right <-> right

if ( !down_right->adj.top )

continue;

// down_right <-> down

if ( !down_right->adj.left )

continue;

// main diagonal

// this <-> down_right

it->adj.bottomright = 0;

down_right->adj.topleft = 0;

// secondary diagonal

// right <-> down

(it + 1)->adj.bottomleft = 0;

(it + graph.width())->adj.topright = 0;

}

}

}

void Kopf2011::_remove_crossing_edges_unsafe(PixelGraph &graph,

const Options &options)

{

if ( graph.width() < 2 || graph.height() < 2 )

return;

// Iterate over the graph, 2x2 blocks at time

PixelGraph::iterator it = graph.begin();

for (int i = 0 ; i != graph.height() - 1 ; ++i, ++it ) {

for ( int j = 0 ; j != graph.width() - 1 ; ++j, ++it ) {

using std::pair;

using std::make_pair;

typedef pair<PixelGraph::iterator, PixelGraph::iterator> Edge;

typedef pair<Edge, int> EdgeWeight;

EdgeWeight diagonals[2] = {

make_pair(make_pair(it, graph.nodeBottomRight(it)), 0),

make_pair(make_pair(graph.nodeRight(it), graph.nodeBottom(it)),

0)

};

// Check if there are crossing edges

if ( !diagonals[0].first.first->adj.bottomright

|| !diagonals[1].first.first->adj.bottomleft ) {

continue;

}

// Compute weights

for ( int i = 0 ; i != 2 ; ++i ) {

// Curves and islands heuristics

PixelGraph::const_iterator a = diagonals[i].first.first;

PixelGraph::const_iterator b = diagonals[i].first.second;

diagonals[i].second += Heuristics::curves(graph, a, b)

* options.curvesMultiplier;

diagonals[i].second += Heuristics::islands(a, b)

* options.islandsWeight;

}

{

// Sparse pixels heuristic

Heuristics::SparsePixels sparse_pixels;

for ( int i = 0 ; i != 2 ; ++i )

sparse_pixels.diagonals[i] = diagonals[i];

sparse_pixels(graph, options.sparsePixelsRadius);

for ( int i = 0 ; i != 2 ; ++i ) {

diagonals[i].second += sparse_pixels.diagonals[i].second

* options.sparsePixelsMultiplier;

}

}

// Remove edges with lower weight

if ( diagonals[0].second > diagonals[1].second ) {

diagonals[1].first.first->adj.bottomleft = 0;

diagonals[1].first.second->adj.topright = 0;

} else if ( diagonals[0].second < diagonals[1].second ) {

diagonals[0].first.first->adj.bottomright = 0;

diagonals[0].first.second->adj.topleft = 0;

} else {

diagonals[0].first.first->adj.bottomright = 0;

diagonals[0].first.second->adj.topleft = 0;

diagonals[1].first.first->adj.bottomleft = 0;

diagonals[1].first.second->adj.topright = 0;

}

}

}

}

inline int Heuristics::curves(const PixelGraph &graph,

PixelGraph::const_iterator a,

PixelGraph::const_iterator b)

{

int count = 1;

ToPtr<PixelGraph::Node> to_ptr;

ToIter<PixelGraph::Node> to_iter(graph.begin());

// b -> a

// and then a -> b

for ( int i = 0 ; i != 2 ; ++i ) {

PixelGraph::const_iterator it = i ? a : b;

PixelGraph::const_iterator prev = i ? b : a;

int local_count = 0;

// Used to avoid inifinite loops in circular-like edges

const PixelGraph::const_iterator initial = it;

while ( it->adjsize() == 2 ) {

++local_count;

// Iterate to next

{

// There are only two values that won't be zero'ed

// and one of them has the same value of prev

guintptr aux = (it->adj.top

* guintptr(to_ptr(graph.nodeTop(it))))

+ (it->adj.topright

* guintptr(to_ptr(graph.nodeTopRight(it))))

+ (it->adj.right

* guintptr(to_ptr(graph.nodeRight(it))))

+ (it->adj.bottomright

* guintptr(to_ptr(graph.nodeBottomRight(it))))

+ (it->adj.bottom

* guintptr(to_ptr(graph.nodeBottom(it))))

+ (it->adj.bottomleft

* guintptr(to_ptr(graph.nodeBottomLeft(it))))

+ (it->adj.left

* guintptr(to_ptr(graph.nodeLeft(it))))

+ (it->adj.topleft

* guintptr(to_ptr(graph.nodeTopLeft(it))))

- guintptr(to_ptr(prev));

prev = it;

it = to_iter(reinterpret_cast<PixelGraph::Node const*>(aux));

}

// Break infinite loops

if ( it == initial )

return local_count;

}

count += local_count;

}

return count;

}

inline void Heuristics::SparsePixels::operator ()(const PixelGraph &graph,

unsigned radius)

{

if ( !graph.width() || !graph.height() )

return;

// Clear weights

for ( int i = 0 ; i != 2 ; ++i )

diagonals[i].second = 0;

if ( !radius )

return;

// Fix radius/bounds

{

unsigned x = graph.toX(diagonals[MAIN_DIAGONAL].first.first);

unsigned y = graph.toY(diagonals[MAIN_DIAGONAL].first.first);

unsigned displace = radius - 1;

{

unsigned minor = std::min(x, y);

if ( displace > minor ) {

displace = minor;

radius = displace + 1;

}

}

displace = radius;

if ( x + displace >= unsigned(graph.width()) ) {

displace = unsigned(graph.width()) - x - 1;

radius = displace;

}

if ( y + displace >= unsigned(graph.height()) ) {

displace = unsigned(graph.height()) - y - 1;

radius = displace;

}

}

if ( !radius )

return;

// Iterate over nodes and count them

{

PixelGraph::const_iterator it = diagonals[MAIN_DIAGONAL].first.first;

for ( unsigned i = radius - 1 ; i ; --i )

it = graph.nodeTopLeft(it);

bool invert = false;

for ( unsigned i = 0 ; i != 2 * radius ; ++i ) {

for ( unsigned j = 0 ; j != 2 * radius ; ++j ) {

for ( int k = 0 ; k != 2 ; ++k ) {

diagonals[k].second

+= similar_colors(it, diagonals[k].first.first->rgba,

diagonals[k].first.second->rgba);

}

it = (invert ? graph.nodeLeft(it) : graph.nodeRight(it));

}

it = (invert ? graph.nodeRight(it) : graph.nodeLeft(it));

invert = !invert;

it = graph.nodeBottom(it);

}

}

int minor = std::min(diagonals[0].second, diagonals[1].second);

for ( int i = 0 ; i != 2 ; ++i )

diagonals[i].second -= minor;

std::swap(diagonals[0].second, diagonals[1].second);

}

inline bool

Heuristics::SparsePixels::similar_colors(PixelGraph::const_iterator n,

const guint8 (&a)[4],

const guint8 (&b)[4])

{

using colorspace::similar_colors;

return similar_colors(n->rgba, a) || similar_colors(n->rgba, b);

}

inline bool Heuristics::islands(PixelGraph::const_iterator a,

PixelGraph::const_iterator b)

{

if ( a->adjsize() == 1 || b->adjsize() == 1 )

return true;

return false;

}

} // namespace Tracer