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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
|
///////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2004, Industrial Light & Magic, a division of Lucas
// Digital Ltd. LLC
//
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Industrial Light & Magic nor the names of
// its contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
///////////////////////////////////////////////////////////////////////////
//-----------------------------------------------------------------------------
//
// function makeLatLongMap() -- makes latitude-longitude environment maps
//
//-----------------------------------------------------------------------------
#include <makeLatLongMap.h>
#include <ImfRgbaFile.h>
#include <ImfTiledRgbaFile.h>
#include <ImfStandardAttributes.h>
#include <EnvmapImage.h>
#include "Iex.h"
#include <iostream>
#include <algorithm>
using namespace std;
using namespace Imf;
using namespace Imath;
void
makeLatLongMap (const char inFileName[],
const char outFileName[],
int tileWidth,
int tileHeight,
LevelMode levelMode,
LevelRoundingMode roundingMode,
Compression compression,
int mapWidth,
float padTop,
float padBottom,
float filterRadius,
int numSamples,
bool verbose)
{
if (levelMode == RIPMAP_LEVELS)
{
throw Iex::NoImplExc ("Cannot generate ripmap "
"latitude-longitude environments.");
}
//
// Read the input image, and if necessary,
// pad the image at the top and bottom.
//
EnvmapImage image1;
Header header;
RgbaChannels channels;
{
RgbaInputFile in (inFileName);
if (verbose)
cout << "reading file " << inFileName << endl;
header = in.header();
channels = in.channels();
Envmap type = ENVMAP_LATLONG;
if (hasEnvmap (in.header()))
type = envmap (in.header());
const Box2i &dw = in.dataWindow();
int w = dw.max.x - dw.min.x + 1;
int h = dw.max.y - dw.min.y + 1;
int pt = 0;
int pb = 0;
if (type == ENVMAP_LATLONG)
{
pt = int (padTop * h + 0.5f);
pb = int (padBottom * h + 0.5f);
}
Box2i paddedDw (V2i (dw.min.x, dw.min.y - pt),
V2i (dw.max.x, dw.max.y + pb));
image1.resize (type, paddedDw);
Array2D<Rgba> &pixels = image1.pixels();
in.setFrameBuffer (&pixels[-paddedDw.min.y][-paddedDw.min.x], 1, w);
in.readPixels (dw.min.y, dw.max.y);
for (int y = 0; y < pt; ++y)
for (int x = 0; x < w; ++x)
pixels[y][x] = pixels[pt][x];
for (int y = h + pt; y < h + pt + pb; ++y)
{
for (int x = 0; x < w; ++x)
pixels[y][x] = pixels[h + pt - 1][x];
}
}
//
// Open the file that will contain the latitude-longitude map,
// and write the header.
//
int mapHeight = mapWidth / 2;
header.dataWindow() = Box2i (V2i (0, 0), V2i (mapWidth - 1, mapHeight - 1));
header.displayWindow() = header.dataWindow();
header.compression() = compression;
addEnvmap (header, ENVMAP_LATLONG);
TiledRgbaOutputFile out (outFileName,
header,
channels,
tileWidth, tileHeight,
levelMode,
roundingMode);
if (verbose)
cout << "writing file " << outFileName << endl;
//
// Generate the pixels for the various levels of the latitude-longitude
// map, and store them in the file. The pixels for the highest-resolution
// level are generated by resampling the original input image; for each of
// the other levels, the pixels are generated by resampling the previous
// level.
//
EnvmapImage image2;
EnvmapImage *iptr1 = &image1;
EnvmapImage *iptr2 = &image2;
for (int level = 0; level < out.numLevels(); ++level)
{
if (verbose)
cout << "level " << level << endl;
Box2i dw = out.dataWindowForLevel (level);
int w = dw.max.x - dw.min.x + 1;
int h = dw.max.y - dw.min.y + 1;
float radius = 0.5f * 2 * M_PI * filterRadius / w;
iptr2->resize (ENVMAP_LATLONG, dw);
iptr2->clear ();
Array2D<Rgba> &pixels = iptr2->pixels();
for (int y = 0; y < h; ++y)
{
for (int x = 0; x < w; ++x)
{
V3f dir = LatLongMap::direction (dw, V2f (x, y));
pixels[y][x] = iptr1->filteredLookup (dir, radius, numSamples);
}
}
out.setFrameBuffer (&pixels[0][0], 1, dw.max.x + 1);
for (int tileY = 0; tileY < out.numYTiles (level); ++tileY)
for (int tileX = 0; tileX < out.numXTiles (level); ++tileX)
out.writeTile (tileX, tileY, level);
swap (iptr1, iptr2);
}
if (verbose)
cout << "done." << endl;
}
|
