\n-
\n+
\n
\n
\n
\n
\n
\n
\n
\n@@ -118,223 +118,882 @@\n
\n
\n
\n
\n
\n
\n
\n-
\n-
25#ifndef OPENSUBDIV3_FAR_PATCH_MAP_H \n-
26#define OPENSUBDIV3_FAR_PATCH_MAP_H \n-
\n-
28#include "../version.h" \n-
\n-
30#include "../far/patchTable.h" \n-
\n-
\n+
24#ifndef OPENSUBDIV3_VTR_LEVEL_H \n+
25#define OPENSUBDIV3_VTR_LEVEL_H \n+
\n+
27#include "../version.h" \n+
\n+
29#include "../sdc/types.h" \n+
30#include "../sdc/crease.h" \n+
31#include "../sdc/options.h" \n+
32#include "../vtr/types.h" \n
\n-
\n-
35namespace OPENSUBDIV_VERSION {
\n-
\n-
\n+
\n+
\n+
\n+
\n
\n-
\n-
\n-
\n+
\n+
\n+
41namespace OPENSUBDIV_VERSION {
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
77 void initializeHandles(
PatchTable const & patchTable);
\n-
78 void initializeQuadtree(
PatchTable const & patchTable);
\n-
\n-
\n-
\n-
\n-
83 QuadNode() { std::memset(
this, 0,
sizeof(QuadNode)); }
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n
\n-
\n-
\n-
\n-
92 void SetChildren(
int index);
\n-
\n-
\n-
95 void SetChild(
int quadrant,
int index,
bool isLeaf);
\n-
\n-
\n-
\n-
99 typedef std::vector<QuadNode> QuadTree;
\n-
\n-
\n-
102 void assignRootNode(QuadNode * node,
int index);
\n-
103 QuadNode * assignLeafOrChildNode(QuadNode * node,
bool isLeaf,
int quad,
int index);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
103 void clear() { std::memset((
void*)
this, 0,
sizeof(VTag)); }
\n
\n-
\n-
106 static int transformUVToQuadQuadrant(T
const & median, T & u, T & v);
\n-
\n-
108 static int transformUVToTriQuadrant(T
const & median, T & u, T & v,
bool & rotated);
\n-
\n-
\n-
111 bool _patchesAreTriangular;
\n-
\n-
\n-
\n-
\n-
\n-
117 std::vector<Handle> _handles;
\n-
118 std::vector<QuadNode> _quadtree;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
143PatchMap::transformUVToQuadQuadrant(T
const & median, T & u, T & v) {
\n-
\n-
145 int uHalf = (u >= median);
\n-
146 if (uHalf) u -= median;
\n+
105 typedef unsigned short VTagSize;
\n+
\n+
107 VTagSize _nonManifold : 1;
\n+
108 VTagSize _xordinary : 1;
\n+
109 VTagSize _boundary : 1;
\n+
110 VTagSize _corner : 1;
\n+
111 VTagSize _infSharp : 1;
\n+
112 VTagSize _semiSharp : 1;
\n+
113 VTagSize _semiSharpEdges : 1;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
120 VTagSize _incomplete : 1;
\n+
121 VTagSize _incidIrregFace : 1;
\n+
\n+
\n+
124 VTagSize _infSharpEdges : 1;
\n+
125 VTagSize _infSharpCrease : 1;
\n+
126 VTagSize _infIrregular : 1;
\n+
\n+
\n+
129 explicit VTag(VTagSize bits) {
\n+
130 std::memcpy(
this, &bits,
sizeof(bits));
\n+
\n+
132 VTagSize getBits()
const {
\n+
\n+
134 std::memcpy(&bits,
this,
sizeof(bits));
\n+
\n+
\n+
\n+
138 static VTag BitwiseOr(VTag
const vTags[],
int size = 4);
\n+
\n+
\n+
\n+
\n+
\n+
144 void clear() { std::memset((
void*)
this, 0,
sizeof(ETag)); }
\n+
\n+
146 typedef unsigned char ETagSize;
\n
\n-
148 int vHalf = (v >= median);
\n-
149 if (vHalf) v -= median;
\n-
\n-
151 return (vHalf << 1) | uHalf;
\n-
\n-
\n-
\n-
\n-
156PatchMap::transformUVToTriQuadrant(T
const & median, T & u, T & v,
bool & rotated) {
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
167 if ((u + v) >= median) {
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
183 if ((u + v) < median) {
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
200 if ((faceid < _minPatchFace) || (faceid > _maxPatchFace))
return 0;
\n-
\n-
202 QuadNode
const * node = &_quadtree[faceid - _minPatchFace];
\n-
\n-
204 if (!node->children[0].isSet)
return 0;
\n-
\n-
\n-
\n-
\n-
209 assert( (u>=0.0) && (u<=1.0) && (v>=0.0) && (v<=1.0) );
\n+
148 ETagSize _nonManifold : 1;
\n+
149 ETagSize _boundary : 1;
\n+
150 ETagSize _infSharp : 1;
\n+
151 ETagSize _semiSharp : 1;
\n+
\n+
\n+
154 explicit ETag(ETagSize bits) {
\n+
155 std::memcpy(
this, &bits,
sizeof(bits));
\n+
\n+
157 ETagSize getBits()
const {
\n+
\n+
159 std::memcpy(&bits,
this,
sizeof(bits));
\n+
\n+
\n+
\n+
163 static ETag BitwiseOr(ETag
const eTags[],
int size = 4);
\n+
\n+
\n+
\n+
\n+
168 void clear() { std::memset((
void*)
this, 0,
sizeof(FTag)); }
\n+
\n+
170 typedef unsigned char FTagSize;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
194 VSpan() { std::memset((
void*)
this, 0,
sizeof(VSpan)); }
\n+
\n+
196 void clear() { std::memset((
void*)
this, 0,
sizeof(VSpan)); }
\n+
197 bool isAssigned()
const {
return _numFaces > 0; }
\n+
\n+
\n+
\n+
\n+
\n+
203 unsigned short _periodic : 1;
\n+
204 unsigned short _sharp : 1;
\n+
\n+
\n+
\n+
\n+
\n
\n-
\n-
212 bool triRotated =
false;
\n+
\n+
212 int getDepth()
const {
return _depth; }
\n
\n-
214 for (
int depth = 0; depth <= _maxDepth; ++depth, median *= 0.5) {
\n-
\n-
216 int quadrant = _patchesAreTriangular
\n-
217 ? transformUVToTriQuadrant(median, u, v, triRotated)
\n-
218 : transformUVToQuadQuadrant(median, u, v);
\n-
\n-
\n-
221 assert(node->children[quadrant].isSet);
\n-
\n-
223 if (node->children[quadrant].isLeaf) {
\n-
224 return &_handles[node->children[quadrant].index];
\n-
\n-
226 node = &_quadtree[node->children[quadrant].index];
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
236using namespace OPENSUBDIV_VERSION;
\n-
\n-
\n-
\n-
\n-
\n-
An quadtree-based map connecting coarse faces to their sub-patches.
\n-
PatchMap(PatchTable const &patchTable)
Constructor.
\n-
Handle const * FindPatch(int patchFaceId, double u, double v) const
Returns a handle to the sub-patch of the face at the given (u,v). Note that the patch face ID corresp...
\n-
PatchTable::PatchHandle Handle
\n-
\n-
\n-
\n-
\n-
Container for arrays of parametric patches.
\n-
Handle that can be used as unique patch identifier within PatchTable.
\n+
214 int getNumVertices()
const {
return _vertCount; }
\n+
215 int getNumFaces()
const {
return _faceCount; }
\n+
216 int getNumEdges()
const {
return _edgeCount; }
\n+
\n+
\n+
219 int getNumFaceVerticesTotal()
const {
return (
int) _faceVertIndices.size(); }
\n+
220 int getNumFaceEdgesTotal()
const {
return (
int) _faceEdgeIndices.size(); }
\n+
221 int getNumEdgeVerticesTotal()
const {
return (
int) _edgeVertIndices.size(); }
\n+
222 int getNumEdgeFacesTotal()
const {
return (
int) _edgeFaceIndices.size(); }
\n+
223 int getNumVertexFacesTotal()
const {
return (
int) _vertFaceIndices.size(); }
\n+
224 int getNumVertexEdgesTotal()
const {
return (
int) _vertEdgeIndices.size(); }
\n+
\n+
226 int getMaxValence()
const {
return _maxValence; }
\n+
227 int getMaxEdgeFaces()
const {
return _maxEdgeFaces; }
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
252 float getEdgeSharpness(
Index edgeIndex)
const;
\n+
253 float getVertexSharpness(
Index vertIndex)
const;
\n+
\n+
\n+
\n+
\n+
\n+
259 void setFaceHole(
Index faceIndex,
bool b);
\n+
260 bool isFaceHole(
Index faceIndex)
const;
\n+
\n+
\n+
263 Sdc::Options getFVarOptions(
int channel)
const;
\n+
264 int getNumFVarChannels()
const {
return (
int) _fvarChannels.size(); }
\n+
265 int getNumFVarValues(
int channel)
const;
\n+
\n+
\n+
268 FVarLevel & getFVarLevel(
int channel) {
return *_fvarChannels[channel]; }
\n+
269 FVarLevel
const & getFVarLevel(
int channel)
const {
return *_fvarChannels[channel]; }
\n+
\n+
\n+
272 void setEdgeNonManifold(
Index edgeIndex,
bool b);
\n+
273 bool isEdgeNonManifold(
Index edgeIndex)
const;
\n+
\n+
275 void setVertexNonManifold(
Index vertIndex,
bool b);
\n+
276 bool isVertexNonManifold(
Index vertIndex)
const;
\n+
\n+
\n+
279 VTag
const & getVertexTag(
Index vertIndex)
const {
return _vertTags[vertIndex]; }
\n+
280 ETag
const & getEdgeTag(
Index edgeIndex)
const {
return _edgeTags[edgeIndex]; }
\n+
281 FTag
const & getFaceTag(
Index faceIndex)
const {
return _faceTags[faceIndex]; }
\n+
\n+
283 VTag & getVertexTag(
Index vertIndex) {
return _vertTags[vertIndex]; }
\n+
284 ETag & getEdgeTag(
Index edgeIndex) {
return _edgeTags[edgeIndex]; }
\n+
285 FTag & getFaceTag(
Index faceIndex) {
return _faceTags[faceIndex]; }
\n+
\n+
\n+
\n+
\n+
\n+
291 TOPOLOGY_MISSING_EDGE_FACES=0,
\n+
292 TOPOLOGY_MISSING_EDGE_VERTS,
\n+
293 TOPOLOGY_MISSING_FACE_EDGES,
\n+
294 TOPOLOGY_MISSING_FACE_VERTS,
\n+
295 TOPOLOGY_MISSING_VERT_FACES,
\n+
296 TOPOLOGY_MISSING_VERT_EDGES,
\n+
\n+
298 TOPOLOGY_FAILED_CORRELATION_EDGE_FACE,
\n+
299 TOPOLOGY_FAILED_CORRELATION_FACE_VERT,
\n+
300 TOPOLOGY_FAILED_CORRELATION_FACE_EDGE,
\n+
\n+
302 TOPOLOGY_FAILED_ORIENTATION_INCIDENT_EDGE,
\n+
303 TOPOLOGY_FAILED_ORIENTATION_INCIDENT_FACE,
\n+
304 TOPOLOGY_FAILED_ORIENTATION_INCIDENT_FACES_EDGES,
\n+
\n+
306 TOPOLOGY_DEGENERATE_EDGE,
\n+
307 TOPOLOGY_NON_MANIFOLD_EDGE,
\n+
\n+
309 TOPOLOGY_INVALID_CREASE_EDGE,
\n+
310 TOPOLOGY_INVALID_CREASE_VERT
\n+
\n+
\n+
313 static char const * getTopologyErrorString(TopologyError errCode);
\n+
\n+
315 typedef void (* ValidationCallback)(TopologyError errCode,
char const * msg,
void const * clientData);
\n+
\n+
317 bool validateTopology(ValidationCallback callback=0,
void const * clientData=0)
const;
\n+
\n+
319 void print(
const Refinement* parentRefinement = 0)
const;
\n+
\n+
\n+
\n+
\n+
324 bool isSingleCreasePatch(
Index face,
float* sharpnessOut=NULL,
int* rotationOut=NULL)
const;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
337 bool doesVertexFVarTopologyMatch(
Index vIndex,
int fvarChannel)
const;
\n+
338 bool doesFaceFVarTopologyMatch(
Index fIndex,
int fvarChannel)
const;
\n+
339 bool doesEdgeFVarTopologyMatch(
Index eIndex,
int fvarChannel)
const;
\n+
\n+
341 void getFaceVTags(
Index fIndex, VTag vTags[],
int fvarChannel = -1)
const;
\n+
342 void getFaceETags(
Index fIndex, ETag eTags[],
int fvarChannel = -1)
const;
\n+
\n+
344 VTag getFaceCompositeVTag(
Index fIndex,
int fvarChannel = -1)
const;
\n+
\n+
\n+
347 VTag getVertexCompositeFVarVTag(
Index vIndex,
int fvarChannel)
const;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
355 int gatherQuadLinearPatchPoints(
Index fIndex,
Index patchPoints[],
int rotation = 0,
\n+
356 int fvarChannel = -1)
const;
\n+
\n+
358 int gatherQuadRegularInteriorPatchPoints(
Index fIndex,
Index patchPoints[],
int rotation = 0,
\n+
359 int fvarChannel = -1)
const;
\n+
360 int gatherQuadRegularBoundaryPatchPoints(
Index fIndex,
Index patchPoints[],
int boundaryEdgeInFace,
\n+
361 int fvarChannel = -1)
const;
\n+
362 int gatherQuadRegularCornerPatchPoints(
Index fIndex,
Index patchPoints[],
int cornerVertInFace,
\n+
363 int fvarChannel = -1)
const;
\n+
\n+
365 int gatherQuadRegularRingAroundVertex(
Index vIndex,
Index ringPoints[],
\n+
366 int fvarChannel = -1)
const;
\n+
367 int gatherQuadRegularPartialRingAroundVertex(
Index vIndex, VSpan
const & span,
Index ringPoints[],
\n+
368 int fvarChannel = -1)
const;
\n+
\n+
\n+
371 int gatherTriRegularInteriorPatchPoints(
Index fIndex,
Index patchVerts[],
int rotation = 0)
const;
\n+
372 int gatherTriRegularBoundaryVertexPatchPoints(
Index fIndex,
Index patchVerts[],
int boundaryVertInFace)
const;
\n+
373 int gatherTriRegularBoundaryEdgePatchPoints(
Index fIndex,
Index patchVerts[],
int boundaryEdgeInFace)
const;
\n+
374 int gatherTriRegularCornerVertexPatchPoints(
Index fIndex,
Index patchVerts[],
int cornerVertInFace)
const;
\n+
375 int gatherTriRegularCornerEdgePatchPoints(
Index fIndex,
Index patchVerts[],
int cornerEdgeInFace)
const;
\n+
\n+
\n+
\n+
379 void resizeFaces(
int numFaces);
\n+
380 void resizeFaceVertices(
int numFaceVertsTotal);
\n+
381 void resizeFaceEdges(
int numFaceEdgesTotal);
\n+
\n+
383 void resizeEdges(
int numEdges);
\n+
384 void resizeEdgeVertices();
\n+
385 void resizeEdgeFaces(
int numEdgeFacesTotal);
\n+
\n+
387 void resizeVertices(
int numVertices);
\n+
388 void resizeVertexFaces(
int numVertexFacesTotal);
\n+
389 void resizeVertexEdges(
int numVertexEdgesTotal);
\n+
\n+
391 void setMaxValence(
int maxValence);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
406 float& getEdgeSharpness(
Index edgeIndex);
\n+
407 float& getVertexSharpness(
Index vertIndex);
\n+
\n+
\n+
410 int createFVarChannel(
int fvarValueCount, Sdc::Options
const& options);
\n+
411 void destroyFVarChannel(
int channel);
\n+
\n+
\n+
\n+
415 void completeFVarChannelTopology(
int channel,
int regBoundaryValence);
\n+
\n+
\n+
\n+
419 int getNumFaceVertices(
Index faceIndex)
const {
return _faceVertCountsAndOffsets[2*faceIndex]; }
\n+
420 int getOffsetOfFaceVertices(
Index faceIndex)
const {
return _faceVertCountsAndOffsets[2*faceIndex + 1]; }
\n+
\n+
422 int getNumFaceEdges(
Index faceIndex)
const {
return getNumFaceVertices(faceIndex); }
\n+
423 int getOffsetOfFaceEdges(
Index faceIndex)
const {
return getOffsetOfFaceVertices(faceIndex); }
\n+
\n+
425 int getNumEdgeVertices(
Index )
const {
return 2; }
\n+
426 int getOffsetOfEdgeVertices(
Index edgeIndex)
const {
return 2 * edgeIndex; }
\n+
\n+
428 int getNumEdgeFaces(
Index edgeIndex)
const {
return _edgeFaceCountsAndOffsets[2*edgeIndex]; }
\n+
429 int getOffsetOfEdgeFaces(
Index edgeIndex)
const {
return _edgeFaceCountsAndOffsets[2*edgeIndex + 1]; }
\n+
\n+
431 int getNumVertexFaces(
Index vertIndex)
const {
return _vertFaceCountsAndOffsets[2*vertIndex]; }
\n+
432 int getOffsetOfVertexFaces(
Index vertIndex)
const {
return _vertFaceCountsAndOffsets[2*vertIndex + 1]; }
\n+
\n+
434 int getNumVertexEdges(
Index vertIndex)
const {
return _vertEdgeCountsAndOffsets[2*vertIndex]; }
\n+
435 int getOffsetOfVertexEdges(
Index vertIndex)
const {
return _vertEdgeCountsAndOffsets[2*vertIndex + 1]; }
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
448 void resizeFaceVertices(
Index FaceIndex,
int count);
\n+
\n+
450 void resizeEdgeFaces(
Index edgeIndex,
int count);
\n+
451 void trimEdgeFaces(
Index edgeIndex,
int count);
\n+
\n+
453 void resizeVertexFaces(
Index vertIndex,
int count);
\n+
454 void trimVertexFaces(
Index vertIndex,
int count);
\n+
\n+
456 void resizeVertexEdges(
Index vertIndex,
int count);
\n+
457 void trimVertexEdges(
Index vertIndex,
int count);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
468 bool completeTopologyFromFaceVertices();
\n+
\n+
\n+
\n+
472 void orientIncidentComponents();
\n+
473 bool orderVertexFacesAndEdges(
Index vIndex,
Index* vFaces,
Index* vEdges)
const;
\n+
474 bool orderVertexFacesAndEdges(
Index vIndex);
\n+
475 void populateLocalIndices();
\n+
\n+
477 IndexArray shareFaceVertCountsAndOffsets()
const;
\n+
\n+
\n+
\n+
481 friend class Refinement;
\n+
482 friend class TriRefinement;
\n+
483 friend class QuadRefinement;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
526 std::vector<Index> _faceVertCountsAndOffsets;
\n+
527 std::vector<Index> _faceVertIndices;
\n+
528 std::vector<Index> _faceEdgeIndices;
\n+
529 std::vector<FTag> _faceTags;
\n+
\n+
\n+
532 std::vector<Index> _edgeVertIndices;
\n+
533 std::vector<Index> _edgeFaceCountsAndOffsets;
\n+
534 std::vector<Index> _edgeFaceIndices;
\n+
535 std::vector<LocalIndex> _edgeFaceLocalIndices;
\n+
\n+
537 std::vector<float> _edgeSharpness;
\n+
538 std::vector<ETag> _edgeTags;
\n+
\n+
\n+
541 std::vector<Index> _vertFaceCountsAndOffsets;
\n+
542 std::vector<Index> _vertFaceIndices;
\n+
543 std::vector<LocalIndex> _vertFaceLocalIndices;
\n+
\n+
545 std::vector<Index> _vertEdgeCountsAndOffsets;
\n+
546 std::vector<Index> _vertEdgeIndices;
\n+
547 std::vector<LocalIndex> _vertEdgeLocalIndices;
\n+
\n+
549 std::vector<float> _vertSharpness;
\n+
550 std::vector<VTag> _vertTags;
\n+
\n+
\n+
553 std::vector<FVarLevel*> _fvarChannels;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
560Level::getFaceVertices(
Index faceIndex)
const {
\n+
561 return ConstIndexArray(&_faceVertIndices[_faceVertCountsAndOffsets[faceIndex*2+1]],
\n+
562 _faceVertCountsAndOffsets[faceIndex*2]);
\n+
\n+
\n+
565Level::getFaceVertices(
Index faceIndex) {
\n+
566 return IndexArray(&_faceVertIndices[_faceVertCountsAndOffsets[faceIndex*2+1]],
\n+
567 _faceVertCountsAndOffsets[faceIndex*2]);
\n+
\n+
\n+
\n+
571Level::resizeFaceVertices(
Index faceIndex,
int count) {
\n+
\n+
573 int* countOffsetPair = &_faceVertCountsAndOffsets[faceIndex*2];
\n+
\n+
575 countOffsetPair[0] = count;
\n+
576 countOffsetPair[1] = (faceIndex == 0) ? 0 : (countOffsetPair[-2] + countOffsetPair[-1]);
\n+
\n+
578 _maxValence = std::max(_maxValence, count);
\n+
\n+
\n+
\n+
582Level::getFaceVertices()
const {
\n+
583 return ConstIndexArray(&_faceVertIndices[0], (
int)_faceVertIndices.size());
\n+
\n+
\n+
\n+
\n+
\n+
\n+
590Level::getFaceEdges(
Index faceIndex)
const {
\n+
591 return ConstIndexArray(&_faceEdgeIndices[_faceVertCountsAndOffsets[faceIndex*2+1]],
\n+
592 _faceVertCountsAndOffsets[faceIndex*2]);
\n+
\n+
\n+
595Level::getFaceEdges(
Index faceIndex) {
\n+
596 return IndexArray(&_faceEdgeIndices[_faceVertCountsAndOffsets[faceIndex*2+1]],
\n+
597 _faceVertCountsAndOffsets[faceIndex*2]);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
604Level::getVertexFaces(
Index vertIndex)
const {
\n+
605 return ConstIndexArray( (&_vertFaceIndices[0]) + _vertFaceCountsAndOffsets[vertIndex*2+1],
\n+
606 _vertFaceCountsAndOffsets[vertIndex*2]);
\n+
\n+
\n+
609Level::getVertexFaces(
Index vertIndex) {
\n+
610 return IndexArray( (&_vertFaceIndices[0]) + _vertFaceCountsAndOffsets[vertIndex*2+1],
\n+
611 _vertFaceCountsAndOffsets[vertIndex*2]);
\n+
\n+
\n+
\n+
615Level::getVertexFaceLocalIndices(
Index vertIndex)
const {
\n+
616 return ConstLocalIndexArray( (&_vertFaceLocalIndices[0]) + _vertFaceCountsAndOffsets[vertIndex*2+1],
\n+
617 _vertFaceCountsAndOffsets[vertIndex*2]);
\n+
\n+
\n+
620Level::getVertexFaceLocalIndices(
Index vertIndex) {
\n+
621 return LocalIndexArray( (&_vertFaceLocalIndices[0]) + _vertFaceCountsAndOffsets[vertIndex*2+1],
\n+
622 _vertFaceCountsAndOffsets[vertIndex*2]);
\n+
\n+
\n+
\n+
626Level::resizeVertexFaces(
Index vertIndex,
int count) {
\n+
627 int* countOffsetPair = &_vertFaceCountsAndOffsets[vertIndex*2];
\n+
\n+
629 countOffsetPair[0] = count;
\n+
630 countOffsetPair[1] = (vertIndex == 0) ? 0 : (countOffsetPair[-2] + countOffsetPair[-1]);
\n+
\n+
\n+
633Level::trimVertexFaces(
Index vertIndex,
int count) {
\n+
634 _vertFaceCountsAndOffsets[vertIndex*2] = count;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
641Level::getVertexEdges(
Index vertIndex)
const {
\n+
642 return ConstIndexArray( (&_vertEdgeIndices[0]) +_vertEdgeCountsAndOffsets[vertIndex*2+1],
\n+
643 _vertEdgeCountsAndOffsets[vertIndex*2]);
\n+
\n+
\n+
646Level::getVertexEdges(
Index vertIndex) {
\n+
647 return IndexArray( (&_vertEdgeIndices[0]) +_vertEdgeCountsAndOffsets[vertIndex*2+1],
\n+
648 _vertEdgeCountsAndOffsets[vertIndex*2]);
\n+
\n+
\n+
\n+
652Level::getVertexEdgeLocalIndices(
Index vertIndex)
const {
\n+
653 return ConstLocalIndexArray( (&_vertEdgeLocalIndices[0]) + _vertEdgeCountsAndOffsets[vertIndex*2+1],
\n+
654 _vertEdgeCountsAndOffsets[vertIndex*2]);
\n+
\n+
\n+
657Level::getVertexEdgeLocalIndices(
Index vertIndex) {
\n+
658 return LocalIndexArray( (&_vertEdgeLocalIndices[0]) + _vertEdgeCountsAndOffsets[vertIndex*2+1],
\n+
659 _vertEdgeCountsAndOffsets[vertIndex*2]);
\n+
\n+
\n+
\n+
663Level::resizeVertexEdges(
Index vertIndex,
int count) {
\n+
664 int* countOffsetPair = &_vertEdgeCountsAndOffsets[vertIndex*2];
\n+
\n+
666 countOffsetPair[0] = count;
\n+
667 countOffsetPair[1] = (vertIndex == 0) ? 0 : (countOffsetPair[-2] + countOffsetPair[-1]);
\n+
\n+
669 _maxValence = std::max(_maxValence, count);
\n+
\n+
\n+
672Level::trimVertexEdges(
Index vertIndex,
int count) {
\n+
673 _vertEdgeCountsAndOffsets[vertIndex*2] = count;
\n+
\n+
\n+
\n+
677Level::setMaxValence(
int valence) {
\n+
678 _maxValence = valence;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
685Level::getEdgeVertices(
Index edgeIndex)
const {
\n+
\n+
\n+
\n+
689Level::getEdgeVertices(
Index edgeIndex) {
\n+
690 return IndexArray(&_edgeVertIndices[edgeIndex*2], 2);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
697Level::getEdgeFaces(
Index edgeIndex)
const {
\n+
\n+
699 _edgeFaceCountsAndOffsets[edgeIndex*2+1],
\n+
700 _edgeFaceCountsAndOffsets[edgeIndex*2]);
\n+
\n+
\n+
703Level::getEdgeFaces(
Index edgeIndex) {
\n+
\n+
705 _edgeFaceCountsAndOffsets[edgeIndex*2+1],
\n+
706 _edgeFaceCountsAndOffsets[edgeIndex*2]);
\n+
\n+
\n+
\n+
710Level::getEdgeFaceLocalIndices(
Index edgeIndex)
const {
\n+
\n+
712 _edgeFaceCountsAndOffsets[edgeIndex*2+1],
\n+
713 _edgeFaceCountsAndOffsets[edgeIndex*2]);
\n+
\n+
\n+
716Level::getEdgeFaceLocalIndices(
Index edgeIndex) {
\n+
\n+
718 _edgeFaceCountsAndOffsets[edgeIndex*2+1],
\n+
719 _edgeFaceCountsAndOffsets[edgeIndex*2]);
\n+
\n+
\n+
\n+
723Level::resizeEdgeFaces(
Index edgeIndex,
int count) {
\n+
724 int* countOffsetPair = &_edgeFaceCountsAndOffsets[edgeIndex*2];
\n+
\n+
726 countOffsetPair[0] = count;
\n+
727 countOffsetPair[1] = (edgeIndex == 0) ? 0 : (countOffsetPair[-2] + countOffsetPair[-1]);
\n+
\n+
729 _maxEdgeFaces = std::max(_maxEdgeFaces, count);
\n+
\n+
\n+
732Level::trimEdgeFaces(
Index edgeIndex,
int count) {
\n+
733 _edgeFaceCountsAndOffsets[edgeIndex*2] = count;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
740Level::getEdgeSharpness(
Index edgeIndex)
const {
\n+
741 return _edgeSharpness[edgeIndex];
\n+
\n+
\n+
744Level::getEdgeSharpness(
Index edgeIndex) {
\n+
745 return _edgeSharpness[edgeIndex];
\n+
\n+
\n+
\n+
749Level::getVertexSharpness(
Index vertIndex)
const {
\n+
750 return _vertSharpness[vertIndex];
\n+
\n+
\n+
753Level::getVertexSharpness(
Index vertIndex) {
\n+
754 return _vertSharpness[vertIndex];
\n+
\n+
\n+
\n+
758Level::getVertexRule(
Index vertIndex)
const {
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
766Level::setFaceHole(
Index faceIndex,
bool b) {
\n+
767 _faceTags[faceIndex]._hole = b;
\n+
\n+
\n+
770Level::isFaceHole(
Index faceIndex)
const {
\n+
771 return _faceTags[faceIndex]._hole;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
778Level::setEdgeNonManifold(
Index edgeIndex,
bool b) {
\n+
779 _edgeTags[edgeIndex]._nonManifold = b;
\n+
\n+
\n+
782Level::isEdgeNonManifold(
Index edgeIndex)
const {
\n+
783 return _edgeTags[edgeIndex]._nonManifold;
\n+
\n+
\n+
\n+
787Level::setVertexNonManifold(
Index vertIndex,
bool b) {
\n+
788 _vertTags[vertIndex]._nonManifold = b;
\n+
\n+
\n+
791Level::isVertexNonManifold(
Index vertIndex)
const {
\n+
792 return _vertTags[vertIndex]._nonManifold;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
799Level::resizeFaces(
int faceCount) {
\n+
800 _faceCount = faceCount;
\n+
801 _faceVertCountsAndOffsets.resize(2 * faceCount);
\n+
\n+
803 _faceTags.resize(faceCount);
\n+
804 std::memset((
void*) &_faceTags[0], 0, _faceCount *
sizeof(FTag));
\n+
\n+
\n+
807Level::resizeFaceVertices(
int totalFaceVertCount) {
\n+
808 _faceVertIndices.resize(totalFaceVertCount);
\n+
\n+
\n+
811Level::resizeFaceEdges(
int totalFaceEdgeCount) {
\n+
812 _faceEdgeIndices.resize(totalFaceEdgeCount);
\n+
\n+
\n+
\n+
816Level::resizeEdges(
int edgeCount) {
\n+
\n+
818 _edgeCount = edgeCount;
\n+
819 _edgeFaceCountsAndOffsets.resize(2 * edgeCount);
\n+
\n+
821 _edgeSharpness.resize(edgeCount);
\n+
822 _edgeTags.resize(edgeCount);
\n+
\n+
\n+
825 std::memset((
void*) &_edgeTags[0], 0, _edgeCount *
sizeof(ETag));
\n+
\n+
\n+
\n+
829Level::resizeEdgeVertices() {
\n+
\n+
831 _edgeVertIndices.resize(2 * _edgeCount);
\n+
\n+
\n+
834Level::resizeEdgeFaces(
int totalEdgeFaceCount) {
\n+
\n+
836 _edgeFaceIndices.resize(totalEdgeFaceCount);
\n+
837 _edgeFaceLocalIndices.resize(totalEdgeFaceCount);
\n+
\n+
\n+
\n+
841Level::resizeVertices(
int vertCount) {
\n+
\n+
843 _vertCount = vertCount;
\n+
844 _vertFaceCountsAndOffsets.resize(2 * vertCount);
\n+
845 _vertEdgeCountsAndOffsets.resize(2 * vertCount);
\n+
\n+
847 _vertSharpness.resize(vertCount);
\n+
848 _vertTags.resize(vertCount);
\n+
849 std::memset((
void*) &_vertTags[0], 0, _vertCount *
sizeof(VTag));
\n+
\n+
\n+
852Level::resizeVertexFaces(
int totalVertFaceCount) {
\n+
\n+
854 _vertFaceIndices.resize(totalVertFaceCount);
\n+
855 _vertFaceLocalIndices.resize(totalVertFaceCount);
\n+
\n+
\n+
858Level::resizeVertexEdges(
int totalVertEdgeCount) {
\n+
\n+
860 _vertEdgeIndices.resize(totalVertEdgeCount);
\n+
861 _vertEdgeLocalIndices.resize(totalVertEdgeCount);
\n+
\n+
\n+
\n+
865Level::shareFaceVertCountsAndOffsets()
const {
\n+
\n+
\n+
\n+
869 (
int)_faceVertCountsAndOffsets.size());
\n+
\n+
\n+
\n+
\n+
\n+
\n+
876using namespace OPENSUBDIV_VERSION;
\n+
\n+
\n+
\n+
\n+
ConstArray< LocalIndex > ConstLocalIndexArray
\n+
Array< LocalIndex > LocalIndexArray
\n+
\n+
ConstArray< Index > ConstIndexArray
\n+
unsigned short LocalIndex
\n+
Array< Index > IndexArray
\n+
\n
![\"doxygen\"/](\"doxygen.svg\")
1.9.8 \n