1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
|
/*
* Copyright (C) 2008-2015 René Rebe
*
* 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; version 2. A copy of the GNU General
* Public License can be found in the file LICENSE.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANT-
* ABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
* Public License for more details.
*
* Alternatively, commercial licensing options are available from the
* copyright holder ExactCODE GmbH Germany.
*
* Based on the svg_test application window,
* Copyright (C) 2002-2005 Maxim Shemanarev (http://www.antigrain.com)
*/
#include <limits.h>
#include <stdlib.h>
#include "agg_basics.h"
#include "agg_rendering_buffer.h"
#include "agg_rasterizer_scanline_aa.h"
#include "agg_scanline_p.h"
#include "agg_renderer_scanline.h"
#include "agg_svg_parser.hh"
#include "svg.hh"
#include "agg.hh" // EI Agg
int SVGCodec::readImage (std::istream* stream, Image& image, const std::string& decompress)
{
agg::svg::path_renderer m_path;
agg::svg::parser p (m_path);
if (stream->peek () != '<')
return false;
try
{
p.parse(*stream);
}
catch(agg::svg::exception& e)
{
std::cerr << e.msg() << std::endl;
return false;
}
double min_x = 0;
double min_y = 0;
double max_x = 0;
double max_y = 0;
const double expand = 0;
const double gamma = 1;
m_path.bounding_rect (&min_x, &min_y, &max_x, &max_y);
// prevent crash for invalid constraints
if (min_x > max_x)
{ double t = max_x; max_x = min_x; min_x = t; }
else if (min_x == max_x)
max_x += 1;
if (min_y > max_y)
{ double t = max_y; max_y = min_y; min_y = t; }
else if (min_y == max_y)
max_y += 1;
image.bps = 8; image.spp = 3;
image.resize ((int)(max_x - min_x), (int)(max_y - min_y));
renderer_exact_image rb (image);
typedef agg::renderer_scanline_aa_solid<renderer_base> renderer_solid;
renderer_solid ren (rb);
rb.clear (agg::rgba(1,1,1));
agg::rasterizer_scanline_aa<> ras;
agg::scanline_p8 sl;
agg::trans_affine mtx;
ras.gamma(agg::gamma_power(gamma));
mtx *= agg::trans_affine_translation ((min_x + max_x) * -0.5,
(min_y + max_y) * -0.5);
//mtx *= agg::trans_affine_scaling (scale);
mtx *= agg::trans_affine_translation ((min_x + max_x) * 0.5,
(min_y + max_y) * 0.5);
m_path.expand(expand);
m_path.render(ras, sl, ren, mtx, rb.clip_box(), 1.0);
//std::cerr << "Vertices=" << m_path.vertex_count() << " Time=" << tm << " ms" std::endl;
return true;
}
bool SVGCodec::writeImage (std::ostream* stream, Image& image, int quality,
const std::string& compress)
{
return false;
}
SVGCodec svg_loader;
|
