rev |
line source |
nuclear@0
|
1 /*
|
nuclear@0
|
2 Open Asset Import Library (assimp)
|
nuclear@0
|
3 ----------------------------------------------------------------------
|
nuclear@0
|
4
|
nuclear@0
|
5 Copyright (c) 2006-2012, assimp team
|
nuclear@0
|
6 All rights reserved.
|
nuclear@0
|
7
|
nuclear@0
|
8 Redistribution and use of this software in source and binary forms,
|
nuclear@0
|
9 with or without modification, are permitted provided that the
|
nuclear@0
|
10 following conditions are met:
|
nuclear@0
|
11
|
nuclear@0
|
12 * Redistributions of source code must retain the above
|
nuclear@0
|
13 copyright notice, this list of conditions and the
|
nuclear@0
|
14 following disclaimer.
|
nuclear@0
|
15
|
nuclear@0
|
16 * Redistributions in binary form must reproduce the above
|
nuclear@0
|
17 copyright notice, this list of conditions and the
|
nuclear@0
|
18 following disclaimer in the documentation and/or other
|
nuclear@0
|
19 materials provided with the distribution.
|
nuclear@0
|
20
|
nuclear@0
|
21 * Neither the name of the assimp team, nor the names of its
|
nuclear@0
|
22 contributors may be used to endorse or promote products
|
nuclear@0
|
23 derived from this software without specific prior
|
nuclear@0
|
24 written permission of the assimp team.
|
nuclear@0
|
25
|
nuclear@0
|
26 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
nuclear@0
|
27 "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
nuclear@0
|
28 LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
nuclear@0
|
29 A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
nuclear@0
|
30 OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
nuclear@0
|
31 SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
nuclear@0
|
32 LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
nuclear@0
|
33 DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
nuclear@0
|
34 THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
nuclear@0
|
35 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
nuclear@0
|
36 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
nuclear@0
|
37
|
nuclear@0
|
38 ----------------------------------------------------------------------
|
nuclear@0
|
39 */
|
nuclear@0
|
40
|
nuclear@0
|
41 /** @file FBXNoteAttribute.cpp
|
nuclear@0
|
42 * @brief Assimp::FBX::NodeAttribute (and subclasses) implementation
|
nuclear@0
|
43 */
|
nuclear@0
|
44 #include "AssimpPCH.h"
|
nuclear@0
|
45
|
nuclear@0
|
46 #ifndef ASSIMP_BUILD_NO_FBX_IMPORTER
|
nuclear@0
|
47
|
nuclear@0
|
48 #include "FBXParser.h"
|
nuclear@0
|
49 #include "FBXDocument.h"
|
nuclear@0
|
50 #include "FBXImporter.h"
|
nuclear@0
|
51 #include "FBXImportSettings.h"
|
nuclear@0
|
52 #include "FBXDocumentUtil.h"
|
nuclear@0
|
53 #include "FBXProperties.h"
|
nuclear@0
|
54
|
nuclear@0
|
55 namespace Assimp {
|
nuclear@0
|
56 namespace FBX {
|
nuclear@0
|
57
|
nuclear@0
|
58 using namespace Util;
|
nuclear@0
|
59
|
nuclear@0
|
60 // ------------------------------------------------------------------------------------------------
|
nuclear@0
|
61 Deformer::Deformer(uint64_t id, const Element& element, const Document& doc, const std::string& name)
|
nuclear@0
|
62 : Object(id,element,name)
|
nuclear@0
|
63 {
|
nuclear@0
|
64 const Scope& sc = GetRequiredScope(element);
|
nuclear@0
|
65
|
nuclear@0
|
66 const std::string& classname = ParseTokenAsString(GetRequiredToken(element,2));
|
nuclear@0
|
67 props = GetPropertyTable(doc,"Deformer.Fbx" + classname,element,sc,true);
|
nuclear@0
|
68 }
|
nuclear@0
|
69
|
nuclear@0
|
70
|
nuclear@0
|
71 // ------------------------------------------------------------------------------------------------
|
nuclear@0
|
72 Deformer::~Deformer()
|
nuclear@0
|
73 {
|
nuclear@0
|
74
|
nuclear@0
|
75 }
|
nuclear@0
|
76
|
nuclear@0
|
77
|
nuclear@0
|
78 // ------------------------------------------------------------------------------------------------
|
nuclear@0
|
79 Cluster::Cluster(uint64_t id, const Element& element, const Document& doc, const std::string& name)
|
nuclear@0
|
80 : Deformer(id,element,doc,name)
|
nuclear@0
|
81 , node()
|
nuclear@0
|
82 {
|
nuclear@0
|
83 const Scope& sc = GetRequiredScope(element);
|
nuclear@0
|
84
|
nuclear@0
|
85 const Element* const Indexes = sc["Indexes"];
|
nuclear@0
|
86 const Element* const Weights = sc["Weights"];
|
nuclear@0
|
87
|
nuclear@0
|
88 const Element& Transform = GetRequiredElement(sc,"Transform",&element);
|
nuclear@0
|
89 const Element& TransformLink = GetRequiredElement(sc,"TransformLink",&element);
|
nuclear@0
|
90
|
nuclear@0
|
91 transform = ReadMatrix(Transform);
|
nuclear@0
|
92 transformLink = ReadMatrix(TransformLink);
|
nuclear@0
|
93
|
nuclear@0
|
94 // it is actually possible that there be Deformer's with no weights
|
nuclear@0
|
95 if (!!Indexes != !!Weights) {
|
nuclear@0
|
96 DOMError("either Indexes or Weights are missing from Cluster",&element);
|
nuclear@0
|
97 }
|
nuclear@0
|
98
|
nuclear@0
|
99 if(Indexes) {
|
nuclear@0
|
100 ParseVectorDataArray(indices,*Indexes);
|
nuclear@0
|
101 ParseVectorDataArray(weights,*Weights);
|
nuclear@0
|
102 }
|
nuclear@0
|
103
|
nuclear@0
|
104 if(indices.size() != weights.size()) {
|
nuclear@0
|
105 DOMError("sizes of index and weight array don't match up",&element);
|
nuclear@0
|
106 }
|
nuclear@0
|
107
|
nuclear@0
|
108 // read assigned node
|
nuclear@0
|
109 const std::vector<const Connection*>& conns = doc.GetConnectionsByDestinationSequenced(ID(),"Model");
|
nuclear@0
|
110 BOOST_FOREACH(const Connection* con, conns) {
|
nuclear@0
|
111 const Model* const mod = ProcessSimpleConnection<Model>(*con, false, "Model -> Cluster", element);
|
nuclear@0
|
112 if(mod) {
|
nuclear@0
|
113 node = mod;
|
nuclear@0
|
114 break;
|
nuclear@0
|
115 }
|
nuclear@0
|
116 }
|
nuclear@0
|
117
|
nuclear@0
|
118 if (!node) {
|
nuclear@0
|
119 DOMError("failed to read target Node for Cluster",&element);
|
nuclear@0
|
120 }
|
nuclear@0
|
121 }
|
nuclear@0
|
122
|
nuclear@0
|
123
|
nuclear@0
|
124 // ------------------------------------------------------------------------------------------------
|
nuclear@0
|
125 Cluster::~Cluster()
|
nuclear@0
|
126 {
|
nuclear@0
|
127
|
nuclear@0
|
128 }
|
nuclear@0
|
129
|
nuclear@0
|
130
|
nuclear@0
|
131 // ------------------------------------------------------------------------------------------------
|
nuclear@0
|
132 Skin::Skin(uint64_t id, const Element& element, const Document& doc, const std::string& name)
|
nuclear@0
|
133 : Deformer(id,element,doc,name)
|
nuclear@0
|
134 {
|
nuclear@0
|
135 const Scope& sc = GetRequiredScope(element);
|
nuclear@0
|
136
|
nuclear@0
|
137 const Element* const Link_DeformAcuracy = sc["Link_DeformAcuracy"];
|
nuclear@0
|
138 if(Link_DeformAcuracy) {
|
nuclear@0
|
139 accuracy = ParseTokenAsFloat(GetRequiredToken(*Link_DeformAcuracy,0));
|
nuclear@0
|
140 }
|
nuclear@0
|
141
|
nuclear@0
|
142 // resolve assigned clusters
|
nuclear@0
|
143 const std::vector<const Connection*>& conns = doc.GetConnectionsByDestinationSequenced(ID(),"Deformer");
|
nuclear@0
|
144
|
nuclear@0
|
145 clusters.reserve(conns.size());
|
nuclear@0
|
146 BOOST_FOREACH(const Connection* con, conns) {
|
nuclear@0
|
147
|
nuclear@0
|
148 const Cluster* const cluster = ProcessSimpleConnection<Cluster>(*con, false, "Cluster -> Skin", element);
|
nuclear@0
|
149 if(cluster) {
|
nuclear@0
|
150 clusters.push_back(cluster);
|
nuclear@0
|
151 continue;
|
nuclear@0
|
152 }
|
nuclear@0
|
153 }
|
nuclear@0
|
154 }
|
nuclear@0
|
155
|
nuclear@0
|
156
|
nuclear@0
|
157 // ------------------------------------------------------------------------------------------------
|
nuclear@0
|
158 Skin::~Skin()
|
nuclear@0
|
159 {
|
nuclear@0
|
160
|
nuclear@0
|
161 }
|
nuclear@0
|
162
|
nuclear@0
|
163
|
nuclear@0
|
164
|
nuclear@0
|
165 }
|
nuclear@0
|
166 }
|
nuclear@0
|
167
|
nuclear@0
|
168 #endif
|
nuclear@0
|
169
|