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
|
//
// Copyright 2013 Pixar
//
// Licensed under the Apache License, Version 2.0 (the "Apache License")
// with the following modification; you may not use this file except in
// compliance with the Apache License and the following modification to it:
// Section 6. Trademarks. is deleted and replaced with:
//
// 6. Trademarks. This License does not grant permission to use the trade
// names, trademarks, service marks, or product names of the Licensor
// and its affiliates, except as required to comply with Section 4(c) of
// the License and to reproduce the content of the NOTICE file.
//
// You may obtain a copy of the Apache License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the Apache License with the above modification is
// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, either express or implied. See the Apache License for the specific
// language governing permissions and limitations under the Apache License.
//
#include <stdio.h>
#include <typeinfo>
#include <iostream>
#include "../../regression/common/hbr_utils.h"
//
// Generates a baseline data set for the hbr_regression tool
//
//------------------------------------------------------------------------------
// Vertex class implementation
struct xyzVV {
xyzVV() { }
xyzVV( int /*i*/ ) { }
xyzVV( float x, float y, float z ) { _pos[0]=x; _pos[1]=y; _pos[2]=z; }
xyzVV( const xyzVV & src ) { _pos[0]=src._pos[0]; _pos[1]=src._pos[1]; _pos[2]=src._pos[2]; }
~xyzVV( ) { }
void AddWithWeight(const xyzVV& src, float weight, void * =0 ) {
_pos[0]+=weight*src._pos[0];
_pos[1]+=weight*src._pos[1];
_pos[2]+=weight*src._pos[2];
}
void AddVaryingWithWeight(const xyzVV& , float, void * =0 ) { }
void Clear( void * =0 ) { _pos[0]=_pos[1]=_pos[2]=0.0f; }
void SetPosition(float x, float y, float z) { _pos[0]=x; _pos[1]=y; _pos[2]=z; }
void ApplyVertexEdit(const OpenSubdiv::HbrVertexEdit<xyzVV> & edit) {
const float *src = edit.GetEdit();
switch(edit.GetOperation()) {
case OpenSubdiv::HbrHierarchicalEdit<xyzVV>::Set:
_pos[0] = src[0];
_pos[1] = src[1];
_pos[2] = src[2];
break;
case OpenSubdiv::HbrHierarchicalEdit<xyzVV>::Add:
_pos[0] += src[0];
_pos[1] += src[1];
_pos[2] += src[2];
break;
case OpenSubdiv::HbrHierarchicalEdit<xyzVV>::Subtract:
_pos[0] -= src[0];
_pos[1] -= src[1];
_pos[2] -= src[2];
break;
}
}
void ApplyMovingVertexEdit(const OpenSubdiv::HbrMovingVertexEdit<xyzVV> &) { }
const float * GetPos() const { return _pos; }
private:
float _pos[3];
};
//------------------------------------------------------------------------------
class xyzFV;
typedef OpenSubdiv::HbrMesh<xyzVV> xyzmesh;
typedef OpenSubdiv::HbrFace<xyzVV> xyzface;
typedef OpenSubdiv::HbrVertex<xyzVV> xyzvertex;
typedef OpenSubdiv::HbrHalfedge<xyzVV> xyzhalfedge;
typedef OpenSubdiv::HbrFaceOperator<xyzVV> xyzFaceOperator;
typedef OpenSubdiv::HbrVertexOperator<xyzVV> xyzVertexOperator;
#include "./init_shapes.h"
//------------------------------------------------------------------------------
static void generate( char const * shapeStr, char const * name, int levels, Scheme scheme=kCatmark ) {
assert(shapeStr);
xyzmesh * mesh = simpleHbr<xyzVV>(shapeStr, scheme, 0);
//int nvf = 4;
//if ( typeid(*(mesh->GetSubdivision())) ==
// typeid( OpenSubdiv::HbrLoopSubdivision<xyzVV>) )
// nvf = 3;
int firstface=0, lastface=mesh->GetNumFaces(),
firstvert=0, lastvert=mesh->GetNumVertices();
for (int l=0; l<levels; ++l ) {
std::stringstream fname ;
fname << name << "_level" << l << ".obj";
printf(" writing \"%s\"\n", fname.str().c_str());
FILE * handle = fopen( fname.str().c_str(), "w" );
if (! handle) {
printf("Could ! open \"%s\" - aborting.\n", fname.str().c_str());
exit(0);
}
// subdivide up to current level
for (int i=firstface; i<lastface; ++i) {
xyzface * f = mesh->GetFace(i);
f->Refine();
}
firstface = lastface;
lastface = mesh->GetNumFaces();
//nfaces = lastface - firstface;
firstvert = lastvert;
lastvert = mesh->GetNumVertices();
//nverts = lastvert - firstvert;
//fprintf(handle, "static char const * %s = \n", fname.str().c_str());
fprintf(handle, "# This file uses centimeters as units for non-parametric coordinates.\n");
for (int i=firstvert; i<lastvert; ++i) {
const float * pos = mesh->GetVertex(i)->GetData().GetPos();
fprintf(handle, "v %.*g %.*g %.*g\n", 9, pos[0], 9, pos[1], 9, pos[2]);
}
fprintf(handle, "s off\n");
for (int i=firstface; i<lastface; ++i) {
xyzface * f = mesh->GetFace(i);
fprintf(handle, "f ");
for (int j=0; j<f->GetNumVertices();) {
int vert = f->GetVertex(j)->GetID()-firstvert;
fprintf(handle, "%d", vert+1);
if (++j<f->GetNumVertices())
fprintf(handle, " ");
}
fprintf(handle, "\n");
}
fprintf(handle, "\n");
fclose(handle);
}
delete mesh;
}
//------------------------------------------------------------------------------
static void usage(char const * appname) {
printf("Usage : %s [-shape <x> -scheme <bilinear, catmark, loop>] [file.obj]\n", appname);
printf(" Valid shapes :\n");
for (int i=0; i<(int)g_shapes.size(); ++i)
printf(" %d : %s\n", i, g_shapes[i].name.c_str());
printf(" %ld : all shapes\n", (long int)g_shapes.size());
}
int g_shapeindex=-1;
std::string g_objfile;
Scheme g_scheme=kCatmark;
//------------------------------------------------------------------------------
static void parseArgs(int argc, char ** argv) {
if (argc==1)
usage(argv[0]);
for (int i=1; i<argc; ++i) {
if (! strcmp(argv[i],"-shape")) {
if (i<(argc-1))
g_shapeindex = atoi( argv[++i] );
if ( g_shapeindex<0 || g_shapeindex>(int)g_shapes.size()) {
printf("-shape : index must be within [%ld %ld]\n", 0L, (long int)g_shapes.size());
exit(0);
}
} else if (! strcmp(argv[i],"-scheme")) {
const char * scheme = NULL;
if (i<(argc-1))
scheme = argv[++i];
if (! strcmp(scheme,"bilinear"))
g_scheme = kBilinear;
else if (! strcmp(scheme,"catmark"))
g_scheme = kCatmark;
else if (! strcmp(scheme,"loop"))
g_scheme = kLoop;
else {
printf("-scheme : must be one of (\"bilinear\", \"catmark\", \"loop\")\n");
exit(0);
}
} else {
if (i<(argc=1))
g_objfile = argv[++i];
else
usage(argv[0]);
}
}
}
//------------------------------------------------------------------------------
int main(int argc, char ** argv) {
int levels=5;
initShapes();
parseArgs(argc, argv);
if ( g_objfile.size() ) {
FILE * handle = fopen( g_objfile.c_str(), "rt" );
if (! handle) {
printf("Could not open \"%s\" - aborting.\n", g_objfile.c_str());
exit(0);
}
fseek( handle, 0, SEEK_END );
size_t size = ftell(handle);
fseek( handle, 0, SEEK_SET );
char * shapeStr = new char[size];
if ( fread( shapeStr, size, 1, handle)!=1 ) {
printf("Error reading \"%s\" - aborting.\n", g_objfile.c_str());
exit(0);
}
fclose(handle);
generate( shapeStr,
g_objfile.c_str(),
levels,
g_scheme );
delete [] shapeStr;
} else if (g_shapeindex>=0) {
if (g_shapeindex==(int)g_shapes.size()) {
for (int i=0; i<(int)g_shapes.size(); ++i)
generate( g_shapes[i].data.c_str(),
g_shapes[i].name.c_str(),
levels,
g_shapes[i].scheme);
} else
generate( g_shapes[g_shapeindex].data.c_str(),
g_shapes[g_shapeindex].name.c_str(),
levels,
g_shapes[g_shapeindex].scheme);
}
}
|