An quadtree-based map connecting coarse faces to their sub-patches. More...
#include <patchMap.h>
Classes | |
struct | Handle |
Handle that can be used as unique patch identifier within PatchTables. More... | |
struct | Handle |
Handle that can be used as unique patch identifier within PatchTables. More... | |
Public Member Functions | |
PatchMap (PatchTables const &patchTables) | |
Constructor. More... | |
Handle const * | FindPatch (int faceid, float u, float v) const |
Returns a handle to the sub-patch of the face at the given (u,v). Note : the faceid corresponds to quadrangulated face indices (ie. quads count as 1 index, non-quads add as many indices as they have vertices) More... | |
An quadtree-based map connecting coarse faces to their sub-patches.
PatchTables::PatchArrays contain lists of patches that represent the limit surface of a mesh, sorted by their topological type. These arrays break the connection between coarse faces and their sub-patches.
The PatchMap provides a quad-tree based lookup structure that, given a singular parametric location, can efficiently return a handle to the sub-patch that contains this location.
Definition at line 49 of file patchMap.h.
|
inline |
Constructor.
patchTables | A valid set of PatchTables |
Definition at line 128 of file patchMap.h.
|
inline |
Returns a handle to the sub-patch of the face at the given (u,v). Note : the faceid corresponds to quadrangulated face indices (ie. quads count as 1 index, non-quads add as many indices as they have vertices)
Returns a handle to the sub-patch of the face at the given (u,v).
faceid | The index of the face |
u | Local u parameter |
v | Local v parameter |
Definition at line 187 of file patchMap.h.