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 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372
|
///////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2012-2018 DreamWorks Animation LLC
//
// All rights reserved. This software is distributed under the
// Mozilla Public License 2.0 ( http://www.mozilla.org/MPL/2.0/ )
//
// Redistributions of source code must retain the above copyright
// and license notice and the following restrictions and disclaimer.
//
// * Neither the name of DreamWorks Animation 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 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.
// IN NO EVENT SHALL THE COPYRIGHT HOLDERS' AND CONTRIBUTORS' AGGREGATE
// LIABILITY FOR ALL CLAIMS REGARDLESS OF THEIR BASIS EXCEED US$250.00.
//
///////////////////////////////////////////////////////////////////////////
#include <cppunit/extensions/HelperMacros.h>
#include <openvdb/Exceptions.h>
#include <openvdb/openvdb.h>
#include <openvdb/tools/MultiResGrid.h>
#include <openvdb/tools/LevelSetSphere.h>
#include <openvdb/tools/Diagnostics.h>
#include <cstdio> // for remove()
class TestMultiResGrid : public CppUnit::TestCase
{
// Use to test logic in openvdb::tools::MultiResGrid
struct CoordMask {
static int Mask(int i, int j, int k) { return (i & 1) | ((j & 1) << 1) | ((k & 1) << 2); }
CoordMask() : mask(0) {}
CoordMask(const openvdb::Coord &c ) : mask( Mask(c[0],c[1],c[2]) ) {}
inline void setCoord(int i, int j, int k) { mask = Mask(i,j,k); }
inline void setCoord(const openvdb::Coord &c) { mask = Mask(c[0],c[1],c[2]); }
inline bool allEven() const { return mask == 0; }
inline bool xOdd() const { return mask == 1; }
inline bool yOdd() const { return mask == 2; }
inline bool zOdd() const { return mask == 4; }
inline bool xyOdd() const { return mask == 3; }
inline bool xzOdd() const { return mask == 5; }
inline bool yzOdd() const { return mask == 6; }
inline bool allOdd() const { return mask == 7; }
int mask;
};// CoordMask
public:
CPPUNIT_TEST_SUITE(TestMultiResGrid);
CPPUNIT_TEST(testTwosComplement);
CPPUNIT_TEST(testCoordMask);
CPPUNIT_TEST(testManualTopology);
CPPUNIT_TEST(testIO);
CPPUNIT_TEST(testModels);
CPPUNIT_TEST_SUITE_END();
void testTwosComplement();
void testCoordMask();
void testManualTopology();
void testIO();
void testModels();
};
CPPUNIT_TEST_SUITE_REGISTRATION(TestMultiResGrid);
// Uncomment to test on models from our web-site
//#define TestMultiResGrid_DATA_PATH "/home/kmu/src/openvdb/data/"
//#define TestMultiResGrid_DATA_PATH "/usr/pic1/Data/OpenVDB/LevelSetModels/"
void
TestMultiResGrid::testTwosComplement()
{
// test bit-operations that assume 2's complement representation of negative integers
CPPUNIT_ASSERT_EQUAL( 1, 13 & 1 );// odd
CPPUNIT_ASSERT_EQUAL( 1,-13 & 1 );// odd
CPPUNIT_ASSERT_EQUAL( 0, 12 & 1 );// even
CPPUNIT_ASSERT_EQUAL( 0,-12 & 1 );// even
CPPUNIT_ASSERT_EQUAL( 0, 0 & 1 );// even
for (int i=-50; i<=50; ++i) {
if ( (i % 2) == 0 ) {//i.e. even number
CPPUNIT_ASSERT_EQUAL( 0, i & 1);
CPPUNIT_ASSERT_EQUAL( i, (i >> 1) << 1 );
} else {//i.e. odd number
CPPUNIT_ASSERT_EQUAL( 1, i & 1);
CPPUNIT_ASSERT( i != (i >> 1) << 1 );
}
}
}
void
TestMultiResGrid::testCoordMask()
{
using namespace openvdb;
CoordMask mask;
mask.setCoord(-4, 2, 18);
CPPUNIT_ASSERT(mask.allEven());
mask.setCoord(1, 2, -6);
CPPUNIT_ASSERT(mask.xOdd());
mask.setCoord(4, -3, -6);
CPPUNIT_ASSERT(mask.yOdd());
mask.setCoord(-8, 2, -7);
CPPUNIT_ASSERT(mask.zOdd());
mask.setCoord(1, -3, 2);
CPPUNIT_ASSERT(mask.xyOdd());
mask.setCoord(1, 2, -7);
CPPUNIT_ASSERT(mask.xzOdd());
mask.setCoord(-10, 3, -3);
CPPUNIT_ASSERT(mask.yzOdd());
mask.setCoord(1, 3,-3);
CPPUNIT_ASSERT(mask.allOdd());
}
void
TestMultiResGrid::testManualTopology()
{
// Perform tests when the sparsity (or topology) of the multiple grids is defined manually
using namespace openvdb;
typedef tools::MultiResGrid<DoubleTree> MultiResGridT;
const double background = -1.0;
const size_t levels = 4;
MultiResGridT::Ptr mrg(new MultiResGridT( levels, background));
CPPUNIT_ASSERT(mrg != nullptr);
CPPUNIT_ASSERT_EQUAL(levels , mrg->numLevels());
CPPUNIT_ASSERT_EQUAL(size_t(0), mrg->finestLevel());
CPPUNIT_ASSERT_EQUAL(levels-1, mrg->coarsestLevel());
// Define grid domain so they exactly overlap!
const int w = 16;//half-width of dense patch on the finest grid level
const CoordBBox bbox( Coord(-w), Coord(w) );// both inclusive
// First check all trees against the background value
for (size_t level = 0; level < mrg->numLevels(); ++level) {
for (CoordBBox::Iterator<true> iter(bbox>>level); iter; ++iter) {
CPPUNIT_ASSERT_DOUBLES_EQUAL(background,
mrg->tree(level).getValue(*iter), /*tolerance=*/0.0);
}
}
// Fill all trees according to a power of two refinement pattern
for (size_t level = 0; level < mrg->numLevels(); ++level) {
mrg->tree(level).fill( bbox>>level, double(level));
mrg->tree(level).voxelizeActiveTiles();// avoid active tiles
// Check values
for (CoordBBox::Iterator<true> iter(bbox>>level); iter; ++iter) {
CPPUNIT_ASSERT_DOUBLES_EQUAL(double(level),
mrg->tree(level).getValue(*iter), /*tolerance=*/0.0);
}
//mrg->tree( level ).print(std::cerr, 2);
// Check bounding box of active voxels
CoordBBox bbox_actual;// Expected Tree dimensions: 33^3 -> 17^3 -> 9^3 ->5^3
mrg->tree( level ).evalActiveVoxelBoundingBox( bbox_actual );
CPPUNIT_ASSERT_EQUAL( bbox >> level, bbox_actual );
}
//pick a grid point that is shared between all the grids
const Coord ijk(0);
// Value at ijk equals the level
CPPUNIT_ASSERT_DOUBLES_EQUAL(2.0, mrg->tree(2).getValue(ijk>>2), /*tolerance=*/ 0.001);
CPPUNIT_ASSERT_DOUBLES_EQUAL(2.0, mrg->sampleValue<0>(ijk, size_t(2)), /*tolerance=*/ 0.001);
CPPUNIT_ASSERT_DOUBLES_EQUAL(2.0, mrg->sampleValue<1>(ijk, size_t(2)), /*tolerance=*/ 0.001);
CPPUNIT_ASSERT_DOUBLES_EQUAL(2.0, mrg->sampleValue<2>(ijk, size_t(2)), /*tolerance=*/ 0.001);
CPPUNIT_ASSERT_DOUBLES_EQUAL(2.0, mrg->sampleValue<1>(ijk, 2.0f), /*tolerance=*/ 0.001);
CPPUNIT_ASSERT_DOUBLES_EQUAL(2.0, mrg->sampleValue<1>(ijk, float(2)), /*tolerance=*/ 0.001);
// Value at ijk at floating point level
CPPUNIT_ASSERT_DOUBLES_EQUAL(2.25, mrg->sampleValue<1>(ijk, 2.25f), /*tolerance=*/ 0.001);
// Value at a floating-point position close to ijk and a floating point level
CPPUNIT_ASSERT_DOUBLES_EQUAL(2.25,
mrg->sampleValue<1>(Vec3R(0.124), 2.25f), /*tolerance=*/ 0.001);
// prolongate at a given point at top level
CPPUNIT_ASSERT_DOUBLES_EQUAL(1.0, mrg->prolongateVoxel(ijk, 0), /*tolerance=*/ 0.0);
// First check the coarsest level (3)
for (CoordBBox::Iterator<true> iter(bbox>>size_t(3)); iter; ++iter) {
CPPUNIT_ASSERT_DOUBLES_EQUAL(3.0, mrg->tree(3).getValue(*iter), /*tolerance=*/0.0);
}
// Prolongate from level 3 -> level 2 and check values
mrg->prolongateActiveVoxels(2);
for (CoordBBox::Iterator<true> iter(bbox>>size_t(2)); iter; ++iter) {
CPPUNIT_ASSERT_DOUBLES_EQUAL(3.0, mrg->tree(2).getValue(*iter), /*tolerance=*/0.0);
}
// Prolongate from level 2 -> level 1 and check values
mrg->prolongateActiveVoxels(1);
for (CoordBBox::Iterator<true> iter(bbox>>size_t(1)); iter; ++iter) {
CPPUNIT_ASSERT_DOUBLES_EQUAL(3.0, mrg->tree(1).getValue(*iter), /*tolerance=*/0.0);
}
// Prolongate from level 1 -> level 0 and check values
mrg->prolongateActiveVoxels(0);
for (CoordBBox::Iterator<true> iter(bbox); iter; ++iter) {
CPPUNIT_ASSERT_DOUBLES_EQUAL(3.0, mrg->tree(0).getValue(*iter), /*tolerance=*/0.0);
}
// Redefine values at the finest level and check values
mrg->finestTree().fill( bbox, 5.0 );
mrg->finestTree().voxelizeActiveTiles();// avoid active tiles
for (CoordBBox::Iterator<true> iter(bbox); iter; ++iter) {
CPPUNIT_ASSERT_DOUBLES_EQUAL(5.0, mrg->tree(0).getValue(*iter), /*tolerance=*/0.0);
}
// USE RESTRICTION BY INJECTION since it doesn't have boundary issues
// // Restrict from level 0 -> level 1 and check values
// mrg->restrictActiveVoxels(1);
// for (CoordBBox::Iterator<true> iter((bbox>>1UL).expandBy(-1)); iter; ++iter) {
// CPPUNIT_ASSERT_DOUBLES_EQUAL(5.0, mrg->tree(1).getValue(*iter), /*tolerance=*/0.0);
// }
// // Restrict from level 1 -> level 2 and check values
// mrg->restrictActiveVoxels(2);
// for (CoordBBox::Iterator<true> iter(bbox>>2UL); iter; ++iter) {
// CPPUNIT_ASSERT_DOUBLES_EQUAL(5.0, mrg->tree(2).getValue(*iter), /*tolerance=*/0.0);
// }
// // Restrict from level 2 -> level 3 and check values
// mrg->restrictActiveVoxels(3);
// for (CoordBBox::Iterator<true> iter(bbox>>3UL); iter; ++iter) {
// CPPUNIT_ASSERT_DOUBLES_EQUAL(5.0, mrg->tree(3).getValue(*iter), /*tolerance=*/0.0);
// }
}
void
TestMultiResGrid::testIO()
{
using namespace openvdb;
const float radius = 1.0f;
const Vec3f center(0.0f, 0.0f, 0.0f);
const float voxelSize = 0.01f;
openvdb::FloatGrid::Ptr ls =
openvdb::tools::createLevelSetSphere<openvdb::FloatGrid>(radius, center, voxelSize);
ls->setName("LevelSetSphere");
typedef tools::MultiResGrid<FloatTree> MultiResGridT;
const size_t levels = 4;
// Generate LOD sequence
MultiResGridT mrg( levels, *ls, /* reduction by injection */ false );
//mrg.print( std::cout, 3 );
CPPUNIT_ASSERT_EQUAL(levels , mrg.numLevels());
CPPUNIT_ASSERT_EQUAL(size_t(0), mrg.finestLevel());
CPPUNIT_ASSERT_EQUAL(levels-1, mrg.coarsestLevel());
// Check inside and outside values
for ( size_t level = 1; level < mrg.numLevels(); ++level) {
const float inside = mrg.sampleValue<1>( Coord(0,0,0), 0UL, level );
CPPUNIT_ASSERT_DOUBLES_EQUAL( -ls->background(), inside,/*tolerance=*/ 0.001 );
const float outside = mrg.sampleValue<1>( Coord( int(1.1*radius/voxelSize) ), 0UL, level );
CPPUNIT_ASSERT_DOUBLES_EQUAL( ls->background(), outside,/*tolerance=*/ 0.001 );
}
const std::string filename( "sphere.vdb" );
// Write grids
io::File outputFile( filename );
outputFile.write( *mrg.grids() );
outputFile.close();
// Read grids
openvdb::initialize();
openvdb::io::File file( filename );
file.open();
GridPtrVecPtr grids = file.getGrids();
CPPUNIT_ASSERT_EQUAL( levels, grids->size() );
//std::cerr << "\nsize = " << grids->size() << std::endl;
for ( size_t i=0; i<grids->size(); ++i ) {
FloatGrid::Ptr grid = gridPtrCast<FloatGrid>(grids->at(i));
CPPUNIT_ASSERT_EQUAL( grid->activeVoxelCount(), mrg.tree(i).activeVoxelCount() );
//grid->print(std::cerr, 3);
}
file.close();
::remove(filename.c_str());
}
void
TestMultiResGrid::testModels()
{
using namespace openvdb;
#ifdef TestMultiResGrid_DATA_PATH
initialize();//required whenever I/O of OpenVDB files is performed!
const std::string path(TestMultiResGrid_DATA_PATH);
std::vector<std::string> filenames;
filenames.push_back("armadillo.vdb");
filenames.push_back("buddha.vdb");
filenames.push_back("bunny.vdb");
filenames.push_back("crawler.vdb");
filenames.push_back("dragon.vdb");
filenames.push_back("iss.vdb");
filenames.push_back("utahteapot.vdb");
util::CpuTimer timer;
for ( size_t i=0; i<filenames.size(); ++i) {
std::cerr << "\n=====================>\"" << filenames[i]
<< "\" =====================" << std::endl;
std::cerr << "Reading \"" << filenames[i] << "\" ...";
io::File file( path + filenames[i] );
file.open(false);//disable delayed loading
FloatGrid::Ptr model = gridPtrCast<FloatGrid>(file.getGrids()->at(0));
std::cerr << " done\nProcessing \"" << filenames[i] << "\" ...";
timer.start("\nMultiResGrid processing");
tools::MultiResGrid<FloatTree> mrg( 6, model );
timer.stop();
std::cerr << "\n High-res level set " << tools::checkLevelSet(*mrg.grid(0)) << "\n";
std::cerr << " done\nWriting \"" << filenames[i] << "\" ...";
io::File file( "/tmp/" + filenames[i] );
file.write( *mrg.grids() );
file.close();
std::cerr << " done\n" << std::endl;
// {// in-betweening
// timer.start("\nIn-betweening");
// FloatGrid::Ptr model3 = mrg.createGrid( 1.9999f );
// timer.stop();
// //
// std::cerr << "\n" << tools::checkLevelSet(*model3) << "\n";
// //
// GridPtrVecPtr grids2( new GridPtrVec );
// grids2->push_back( model3 );
// io::File file2( "/tmp/inbetween_" + filenames[i] );
// file2.write( *grids2 );
// file2.close();
// }
// {// prolongate
// timer.start("\nProlongate");
// mrg.prolongateActiveVoxels(1);
// FloatGrid::Ptr model31= mrg.grid(1);
// timer.stop();
// GridPtrVecPtr grids2( new GridPtrVec );
// grids2->push_back( model31 );
// io::File file2( "/tmp/prolongate_" + filenames[i] );
// file2.write( *grids2 );
// file2.close();
// }
//::remove(filenames[i].c_str());
}
#endif
}
// Copyright (c) 2012-2018 DreamWorks Animation LLC
// All rights reserved. This software is distributed under the
// Mozilla Public License 2.0 ( http://www.mozilla.org/MPL/2.0/ )
|