curve.cpp 32 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386
  1. /*************************************************************************/
  2. /* curve.cpp */
  3. /*************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* http://www.godotengine.org */
  7. /*************************************************************************/
  8. /* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */
  9. /* */
  10. /* Permission is hereby granted, free of charge, to any person obtaining */
  11. /* a copy of this software and associated documentation files (the */
  12. /* "Software"), to deal in the Software without restriction, including */
  13. /* without limitation the rights to use, copy, modify, merge, publish, */
  14. /* distribute, sublicense, and/or sell copies of the Software, and to */
  15. /* permit persons to whom the Software is furnished to do so, subject to */
  16. /* the following conditions: */
  17. /* */
  18. /* The above copyright notice and this permission notice shall be */
  19. /* included in all copies or substantial portions of the Software. */
  20. /* */
  21. /* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
  22. /* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
  23. /* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*/
  24. /* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
  25. /* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
  26. /* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
  27. /* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
  28. /*************************************************************************/
  29. #include "curve.h"
  30. #include "core_string_names.h"
  31. template<class T>
  32. static _FORCE_INLINE_ T _bezier_interp(real_t t, T start, T control_1, T control_2, T end) {
  33. /* Formula from Wikipedia article on Bezier curves. */
  34. real_t omt = (1.0 - t);
  35. real_t omt2 = omt*omt;
  36. real_t omt3 = omt2*omt;
  37. real_t t2 = t*t;
  38. real_t t3 = t2*t;
  39. return start * omt3
  40. + control_1 * omt2 * t * 3.0
  41. + control_2 * omt * t2 * 3.0
  42. + end * t3;
  43. }
  44. #if 0
  45. int Curve2D::get_point_count() const {
  46. return points.size();
  47. }
  48. void Curve2D::add_point(const Vector2& p_pos, const Vector2& p_in, const Vector2& p_out) {
  49. Point n;
  50. n.pos=p_pos;
  51. n.in=p_in;
  52. n.out=p_out;
  53. points.push_back(n);
  54. emit_signal(CoreStringNames::get_singleton()->changed);
  55. }
  56. void Curve2D::set_point_pos(int p_index, const Vector2& p_pos) {
  57. ERR_FAIL_INDEX(p_index,points.size());
  58. points[p_index].pos=p_pos;
  59. emit_signal(CoreStringNames::get_singleton()->changed);
  60. }
  61. Vector2 Curve2D::get_point_pos(int p_index) const {
  62. ERR_FAIL_INDEX_V(p_index,points.size(),Vector2());
  63. return points[p_index].pos;
  64. }
  65. void Curve2D::set_point_in(int p_index, const Vector2& p_in) {
  66. ERR_FAIL_INDEX(p_index,points.size());
  67. points[p_index].in=p_in;
  68. emit_signal(CoreStringNames::get_singleton()->changed);
  69. }
  70. Vector2 Curve2D::get_point_in(int p_index) const {
  71. ERR_FAIL_INDEX_V(p_index,points.size(),Vector2());
  72. return points[p_index].in;
  73. }
  74. void Curve2D::set_point_out(int p_index, const Vector2& p_out) {
  75. ERR_FAIL_INDEX(p_index,points.size());
  76. points[p_index].out=p_out;
  77. emit_signal(CoreStringNames::get_singleton()->changed);
  78. }
  79. Vector2 Curve2D::get_point_out(int p_index) const {
  80. ERR_FAIL_INDEX_V(p_index,points.size(),Vector2());
  81. return points[p_index].out;
  82. }
  83. void Curve2D::remove_point(int p_index) {
  84. ERR_FAIL_INDEX(p_index,points.size());
  85. points.remove(p_index);
  86. emit_signal(CoreStringNames::get_singleton()->changed);
  87. }
  88. Vector2 Curve2D::interpolate(int p_index, float p_offset) const {
  89. int pc = points.size();
  90. ERR_FAIL_COND_V(pc==0,Vector2());
  91. if (p_index >= pc-1)
  92. return points[pc-1].pos;
  93. else if (p_index<0)
  94. return points[0].pos;
  95. Vector2 p0 = points[p_index].pos;
  96. Vector2 p1 = p0+points[p_index].out;
  97. Vector2 p3 = points[p_index+1].pos;
  98. Vector2 p2 = p3+points[p_index+1].in;
  99. return _bezier_interp(p_offset,p0,p1,p2,p3);
  100. }
  101. Vector2 Curve2D::interpolatef(real_t p_findex) const {
  102. if (p_findex>0)
  103. p_findex=0;
  104. else if (p_findex>=points.size())
  105. p_findex=points.size();
  106. return interpolate((int)p_findex,Math::fmod(p_findex,1.0));
  107. }
  108. DVector<Point2> Curve2D::bake(int p_subdivs) const {
  109. int pc = points.size();
  110. DVector<Point2> ret;
  111. if (pc<2)
  112. return ret;
  113. ret.resize((pc-1)*p_subdivs+1);
  114. DVector<Point2>::Write w = ret.write();
  115. const Point *r = points.ptr();
  116. for(int i=0;i<pc;i++) {
  117. int ofs = pc*p_subdivs;
  118. int limit=(i==pc-1)?p_subdivs+1:p_subdivs;
  119. for(int j=0;j<limit;j++) {
  120. Vector2 p0 = r[i].pos;
  121. Vector2 p1 = p0+r[i].out;
  122. Vector2 p3 = r[i].pos;
  123. Vector2 p2 = p3+r[i].in;
  124. real_t t = j/(real_t)p_subdivs;
  125. w[ofs+j]=_bezier_interp(t,p0,p1,p2,p3);
  126. }
  127. }
  128. w = DVector<Point2>::Write();
  129. return ret;
  130. }
  131. void Curve2D::advance(real_t p_distance,int &r_index, real_t &r_pos) const {
  132. int pc = points.size();
  133. ERR_FAIL_COND(pc<2);
  134. if (r_index<0 || r_index>=(pc-1))
  135. return;
  136. Vector2 pos = interpolate(r_index,r_pos);
  137. float sign=p_distance<0 ? -1 : 1;
  138. p_distance=Math::abs(p_distance);
  139. real_t base = r_index+r_pos;
  140. real_t top = 0.1; //a tenth is in theory representative
  141. int iterations=32;
  142. for(int i=0;i<iterations;i++) {
  143. real_t o=base+top*sign;
  144. if (sign>0 && o >=pc) {
  145. top=pc-base;
  146. break;
  147. } else if (sign<0 && o <0) {
  148. top=-base;
  149. break;
  150. }
  151. Vector2 new_d = interpolatef(o);
  152. if (new_d.distance_to(pos) > p_distance)
  153. break;
  154. top*=2.0;
  155. }
  156. real_t bottom = 0.0;
  157. iterations=8;
  158. real_t final_offset;
  159. for(int i=0;i<iterations;i++) {
  160. real_t middle = (bottom+top)*0.5;
  161. real_t o=base+middle*sign;
  162. Vector2 new_d = interpolatef(o);
  163. if (new_d.distance_to(pos) > p_distance) {
  164. bottom=middle;
  165. } else {
  166. top=middle;
  167. }
  168. final_offset=o;
  169. }
  170. r_index=(int)final_offset;
  171. r_pos=Math::fmod(final_offset,1.0);
  172. }
  173. void Curve2D::get_approx_position_from_offset(real_t p_offset,int &r_index, real_t &r_pos,int p_subdivs) const {
  174. ERR_FAIL_COND(points.size()<2);
  175. real_t accum=0;
  176. for(int i=0;i<points.size();i++) {
  177. Vector2 prev_p=interpolate(i,0);
  178. for(int j=1;j<=p_subdivs;j++) {
  179. real_t frac = j/(real_t)p_subdivs;
  180. Vector2 p = interpolate(i,frac);
  181. real_t d = p.distance_to(prev_p);
  182. accum+=d;
  183. if (accum>p_offset) {
  184. r_index=j-1;
  185. if (d>0) {
  186. real_t mf = (p_offset-(accum-d)) / d;
  187. r_pos=frac-(1.0-mf);
  188. } else {
  189. r_pos=frac;
  190. }
  191. return;
  192. }
  193. prev_p=p;
  194. }
  195. }
  196. r_index=points.size()-1;
  197. r_pos=1.0;
  198. }
  199. void Curve2D::set_points_in(const Vector2Array& p_points) {
  200. points.resize(p_points.size());
  201. for (int i=0; i<p_points.size(); i++) {
  202. Point p = points[i];
  203. p.in = p_points[i];
  204. points[i] = p;
  205. };
  206. };
  207. void Curve2D::set_points_out(const Vector2Array& p_points) {
  208. points.resize(p_points.size());
  209. for (int i=0; i<p_points.size(); i++) {
  210. Point p = points[i];
  211. p.out = p_points[i];
  212. points[i] = p;
  213. };
  214. };
  215. void Curve2D::set_points_pos(const Vector2Array& p_points) {
  216. points.resize(p_points.size());
  217. for (int i=0; i<p_points.size(); i++) {
  218. Point p = points[i];
  219. p.pos = p_points[i];
  220. points[i] = p;
  221. };
  222. };
  223. Vector2Array Curve2D::get_points_in() const {
  224. Vector2Array ret;
  225. ret.resize(points.size());
  226. for (int i=0; i<points.size(); i++) {
  227. ret.set(i, points[i].in);
  228. };
  229. return ret;
  230. };
  231. Vector2Array Curve2D::get_points_out() const {
  232. Vector2Array ret;
  233. ret.resize(points.size());
  234. for (int i=0; i<points.size(); i++) {
  235. ret.set(i, points[i].out);
  236. };
  237. return ret;
  238. };
  239. Vector2Array Curve2D::get_points_pos() const {
  240. Vector2Array ret;
  241. ret.resize(points.size());
  242. for (int i=0; i<points.size(); i++) {
  243. ret.set(i, points[i].pos);
  244. };
  245. return ret;
  246. };
  247. void Curve2D::_bind_methods() {
  248. ObjectTypeDB::bind_method(_MD("get_point_count"),&Curve2D::get_point_count);
  249. ObjectTypeDB::bind_method(_MD("add_point","pos","in","out"),&Curve2D::add_point,DEFVAL(Vector2()),DEFVAL(Vector2()));
  250. ObjectTypeDB::bind_method(_MD("set_point_pos","idx","pos"),&Curve2D::set_point_pos);
  251. ObjectTypeDB::bind_method(_MD("get_point_pos","idx"),&Curve2D::get_point_pos);
  252. ObjectTypeDB::bind_method(_MD("set_point_in","idx","pos"),&Curve2D::set_point_in);
  253. ObjectTypeDB::bind_method(_MD("get_point_in","idx"),&Curve2D::get_point_in);
  254. ObjectTypeDB::bind_method(_MD("set_point_out","idx","pos"),&Curve2D::set_point_out);
  255. ObjectTypeDB::bind_method(_MD("get_point_out","idx"),&Curve2D::get_point_out);
  256. ObjectTypeDB::bind_method(_MD("remove_point","idx"),&Curve2D::remove_point);
  257. ObjectTypeDB::bind_method(_MD("interpolate","idx","t"),&Curve2D::interpolate);
  258. ObjectTypeDB::bind_method(_MD("bake","subdivs"),&Curve2D::bake,DEFVAL(10));
  259. ObjectTypeDB::bind_method(_MD("set_points_in"),&Curve2D::set_points_in);
  260. ObjectTypeDB::bind_method(_MD("set_points_out"),&Curve2D::set_points_out);
  261. ObjectTypeDB::bind_method(_MD("set_points_pos"),&Curve2D::set_points_pos);
  262. ObjectTypeDB::bind_method(_MD("get_points_in"),&Curve2D::get_points_in);
  263. ObjectTypeDB::bind_method(_MD("get_points_out"),&Curve2D::get_points_out);
  264. ObjectTypeDB::bind_method(_MD("get_points_pos"),&Curve2D::get_points_pos);
  265. ADD_PROPERTY( PropertyInfo( Variant::VECTOR2_ARRAY, "points_in"), _SCS("set_points_in"),_SCS("get_points_in"));
  266. ADD_PROPERTY( PropertyInfo( Variant::VECTOR2_ARRAY, "points_out"), _SCS("set_points_out"),_SCS("get_points_out"));
  267. ADD_PROPERTY( PropertyInfo( Variant::VECTOR2_ARRAY, "points_pos"), _SCS("set_points_pos"),_SCS("get_points_pos"));
  268. }
  269. Curve2D::Curve2D()
  270. {
  271. }
  272. #endif
  273. int Curve2D::get_point_count() const {
  274. return points.size();
  275. }
  276. void Curve2D::add_point(const Vector2& p_pos, const Vector2& p_in, const Vector2& p_out,int p_atpos) {
  277. Point n;
  278. n.pos=p_pos;
  279. n.in=p_in;
  280. n.out=p_out;
  281. if (p_atpos>=0 && p_atpos<points.size())
  282. points.insert(p_atpos,n);
  283. else
  284. points.push_back(n);
  285. baked_cache_dirty=true;
  286. emit_signal(CoreStringNames::get_singleton()->changed);
  287. }
  288. void Curve2D::set_point_pos(int p_index, const Vector2& p_pos) {
  289. ERR_FAIL_INDEX(p_index,points.size());
  290. points[p_index].pos=p_pos;
  291. baked_cache_dirty=true;
  292. emit_signal(CoreStringNames::get_singleton()->changed);
  293. }
  294. Vector2 Curve2D::get_point_pos(int p_index) const {
  295. ERR_FAIL_INDEX_V(p_index,points.size(),Vector2());
  296. return points[p_index].pos;
  297. }
  298. void Curve2D::set_point_in(int p_index, const Vector2& p_in) {
  299. ERR_FAIL_INDEX(p_index,points.size());
  300. points[p_index].in=p_in;
  301. baked_cache_dirty=true;
  302. emit_signal(CoreStringNames::get_singleton()->changed);
  303. }
  304. Vector2 Curve2D::get_point_in(int p_index) const {
  305. ERR_FAIL_INDEX_V(p_index,points.size(),Vector2());
  306. return points[p_index].in;
  307. }
  308. void Curve2D::set_point_out(int p_index, const Vector2& p_out) {
  309. ERR_FAIL_INDEX(p_index,points.size());
  310. points[p_index].out=p_out;
  311. baked_cache_dirty=true;
  312. emit_signal(CoreStringNames::get_singleton()->changed);
  313. }
  314. Vector2 Curve2D::get_point_out(int p_index) const {
  315. ERR_FAIL_INDEX_V(p_index,points.size(),Vector2());
  316. return points[p_index].out;
  317. }
  318. void Curve2D::remove_point(int p_index) {
  319. ERR_FAIL_INDEX(p_index,points.size());
  320. points.remove(p_index);
  321. baked_cache_dirty=true;
  322. emit_signal(CoreStringNames::get_singleton()->changed);
  323. }
  324. Vector2 Curve2D::interpolate(int p_index, float p_offset) const {
  325. int pc = points.size();
  326. ERR_FAIL_COND_V(pc==0,Vector2());
  327. if (p_index >= pc-1)
  328. return points[pc-1].pos;
  329. else if (p_index<0)
  330. return points[0].pos;
  331. Vector2 p0 = points[p_index].pos;
  332. Vector2 p1 = p0+points[p_index].out;
  333. Vector2 p3 = points[p_index+1].pos;
  334. Vector2 p2 = p3+points[p_index+1].in;
  335. return _bezier_interp(p_offset,p0,p1,p2,p3);
  336. }
  337. Vector2 Curve2D::interpolatef(real_t p_findex) const {
  338. if (p_findex>0)
  339. p_findex=0;
  340. else if (p_findex>=points.size())
  341. p_findex=points.size();
  342. return interpolate((int)p_findex,Math::fmod(p_findex,1.0));
  343. }
  344. void Curve2D::_bake_segment2d(Map<float,Vector2>& r_bake, float p_begin, float p_end,const Vector2& p_a,const Vector2& p_out,const Vector2& p_b, const Vector2& p_in,int p_depth,int p_max_depth,float p_tol) const {
  345. float mp = p_begin+(p_end-p_begin)*0.5;
  346. Vector2 beg = _bezier_interp(p_begin,p_a,p_a+p_out,p_b+p_in,p_b);
  347. Vector2 mid = _bezier_interp(mp,p_a,p_a+p_out,p_b+p_in,p_b);
  348. Vector2 end = _bezier_interp(p_end,p_a,p_a+p_out,p_b+p_in,p_b);
  349. Vector2 na = (mid-beg).normalized();
  350. Vector2 nb = (end-mid).normalized();
  351. float dp = na.dot(nb);
  352. if (dp<Math::cos(Math::deg2rad(p_tol))) {
  353. r_bake[mp]=mid;
  354. }
  355. if (p_depth<p_max_depth) {
  356. _bake_segment2d(r_bake,p_begin,mp,p_a,p_out,p_b,p_in,p_depth+1,p_max_depth,p_tol);
  357. _bake_segment2d(r_bake,mp,p_end,p_a,p_out,p_b,p_in,p_depth+1,p_max_depth,p_tol);
  358. }
  359. }
  360. void Curve2D::_bake() const {
  361. if (!baked_cache_dirty)
  362. return;
  363. baked_max_ofs=0;
  364. baked_cache_dirty=false;
  365. if (points.size()==0) {
  366. baked_point_cache.resize(0);
  367. return;
  368. }
  369. if (points.size()==1) {
  370. baked_point_cache.resize(1);
  371. baked_point_cache.set(0,points[0].pos);
  372. return;
  373. }
  374. Vector2 pos=points[0].pos;
  375. int point=0;
  376. float ofs=0;
  377. List<Vector2> pointlist;
  378. for(int i=0;i<points.size()-1;i++) {
  379. float slen=points[i].pos.distance_to(points[i+1].pos);
  380. float divs = slen / bake_interval;
  381. if (divs>1)
  382. divs=1;
  383. float step = divs*0.1; // 10 substeps ought to be enough?
  384. float p = 0;
  385. while(p<1.0) {
  386. float np=p+step;
  387. if (np>1.0)
  388. np=1.0;
  389. Vector2 npp = _bezier_interp(np, points[i].pos,points[i].pos+points[i].out,points[i+1].pos+points[i+1].in,points[i+1].pos);
  390. float d = pos.distance_to(npp);
  391. if (d>bake_interval) {
  392. // OK! between P and NP there _has_ to be Something, let's go searching!
  393. int iterations = 10; //lots of detail!
  394. float low = p;
  395. float hi = np;
  396. float mid = low+(hi-low)*0.5;
  397. for(int j=0;j<iterations;j++) {
  398. npp = _bezier_interp(mid, points[i].pos,points[i].pos+points[i].out,points[i+1].pos+points[i+1].in,points[i+1].pos);
  399. d = pos.distance_to(npp);
  400. if (bake_interval < d)
  401. hi=mid;
  402. else
  403. low=mid;
  404. mid = low+(hi-low)*0.5;
  405. }
  406. pos=npp;
  407. p=mid;
  408. pointlist.push_back(pos);
  409. } else {
  410. p=np;
  411. }
  412. }
  413. }
  414. Vector2 lastpos = points[points.size()-1].pos;
  415. float rem = pos.distance_to(lastpos);
  416. baked_max_ofs=(pointlist.size()-1)*bake_interval+rem;
  417. pointlist.push_back(lastpos);
  418. baked_point_cache.resize(pointlist.size());
  419. Vector2Array::Write w = baked_point_cache.write();
  420. int idx=0;
  421. for(List<Vector2>::Element *E=pointlist.front();E;E=E->next()) {
  422. w[idx]=E->get();
  423. idx++;
  424. }
  425. }
  426. float Curve2D::get_baked_length() const {
  427. if (baked_cache_dirty)
  428. _bake();
  429. return baked_max_ofs;
  430. }
  431. Vector2 Curve2D::interpolate_baked(float p_offset,bool p_cubic) const{
  432. if (baked_cache_dirty)
  433. _bake();
  434. //validate//
  435. int pc = baked_point_cache.size();
  436. if (pc==0) {
  437. ERR_EXPLAIN("No points in Curve2D");
  438. ERR_FAIL_COND_V(pc==0,Vector2());
  439. }
  440. if (pc==1)
  441. return baked_point_cache.get(0);
  442. int bpc=baked_point_cache.size();
  443. Vector2Array::Read r = baked_point_cache.read();
  444. if (p_offset<0)
  445. return r[0];
  446. if (p_offset>=baked_max_ofs)
  447. return r[bpc-1];
  448. int idx = Math::floor(p_offset/bake_interval);
  449. float frac = Math::fmod(p_offset,bake_interval);
  450. if (idx>=bpc-1) {
  451. return r[bpc-1];
  452. } else if (idx==bpc-2) {
  453. frac/=Math::fmod(baked_max_ofs,bake_interval);
  454. } else {
  455. frac/=bake_interval;
  456. }
  457. if (p_cubic) {
  458. Vector2 pre = idx>0? r[idx-1] : r[idx];
  459. Vector2 post = (idx<(bpc-2))? r[idx+2] : r[idx+1];
  460. return r[idx].cubic_interpolate(r[idx+1],pre,post,frac);
  461. } else {
  462. return r[idx].linear_interpolate(r[idx+1],frac);
  463. }
  464. }
  465. Vector2Array Curve2D::get_baked_points() const {
  466. if (baked_cache_dirty)
  467. _bake();
  468. return baked_point_cache;
  469. }
  470. void Curve2D::set_bake_interval(float p_tolerance){
  471. bake_interval=p_tolerance;
  472. baked_cache_dirty=true;
  473. emit_signal(CoreStringNames::get_singleton()->changed);
  474. }
  475. float Curve2D::get_bake_interval() const{
  476. return bake_interval;
  477. }
  478. Dictionary Curve2D::_get_data() const {
  479. Dictionary dc;
  480. Vector2Array d;
  481. d.resize(points.size()*3);
  482. Vector2Array::Write w = d.write();
  483. for(int i=0;i<points.size();i++) {
  484. w[i*3+0]=points[i].in;
  485. w[i*3+1]=points[i].out;
  486. w[i*3+2]=points[i].pos;
  487. }
  488. w=Vector2Array::Write();
  489. dc["points"]=d;
  490. return dc;
  491. }
  492. void Curve2D::_set_data(const Dictionary& p_data){
  493. ERR_FAIL_COND(!p_data.has("points"));
  494. Vector2Array rp=p_data["points"];
  495. int pc = rp.size();
  496. ERR_FAIL_COND(pc%3!=0);
  497. points.resize(pc/3);
  498. Vector2Array::Read r = rp.read();
  499. for(int i=0;i<points.size();i++) {
  500. points[i].in=r[i*3+0];
  501. points[i].out=r[i*3+1];
  502. points[i].pos=r[i*3+2];
  503. }
  504. baked_cache_dirty=true;
  505. }
  506. Vector2Array Curve2D::tesselate(int p_max_stages,float p_tolerance) const {
  507. Vector2Array tess;
  508. if (points.size()==0) {
  509. return tess;
  510. }
  511. Vector< Map<float,Vector2> > midpoints;
  512. midpoints.resize(points.size()-1);
  513. int pc=1;
  514. for(int i=0;i<points.size()-1;i++) {
  515. _bake_segment2d(midpoints[i],0,1,points[i].pos,points[i].out,points[i+1].pos,points[i+1].in,0,p_max_stages,p_tolerance);
  516. pc++;
  517. pc+=midpoints[i].size();
  518. }
  519. tess.resize(pc);
  520. Vector2Array::Write bpw=tess.write();
  521. bpw[0]=points[0].pos;
  522. int pidx=0;
  523. for(int i=0;i<points.size()-1;i++) {
  524. for(Map<float,Vector2>::Element *E=midpoints[i].front();E;E=E->next()) {
  525. pidx++;
  526. bpw[pidx] = E->get();
  527. }
  528. pidx++;
  529. bpw[pidx] = points[i+1].pos;
  530. }
  531. bpw=Vector2Array::Write ();
  532. return tess;
  533. }
  534. void Curve2D::_bind_methods() {
  535. ObjectTypeDB::bind_method(_MD("get_point_count"),&Curve2D::get_point_count);
  536. ObjectTypeDB::bind_method(_MD("add_point","pos","in","out","atpos"),&Curve2D::add_point,DEFVAL(Vector2()),DEFVAL(Vector2()),DEFVAL(-1));
  537. ObjectTypeDB::bind_method(_MD("set_point_pos","idx","pos"),&Curve2D::set_point_pos);
  538. ObjectTypeDB::bind_method(_MD("get_point_pos","idx"),&Curve2D::get_point_pos);
  539. ObjectTypeDB::bind_method(_MD("set_point_in","idx","pos"),&Curve2D::set_point_in);
  540. ObjectTypeDB::bind_method(_MD("get_point_in","idx"),&Curve2D::get_point_in);
  541. ObjectTypeDB::bind_method(_MD("set_point_out","idx","pos"),&Curve2D::set_point_out);
  542. ObjectTypeDB::bind_method(_MD("get_point_out","idx"),&Curve2D::get_point_out);
  543. ObjectTypeDB::bind_method(_MD("remove_point","idx"),&Curve2D::remove_point);
  544. ObjectTypeDB::bind_method(_MD("interpolate","idx","t"),&Curve2D::interpolate);
  545. ObjectTypeDB::bind_method(_MD("interpolatef","fofs"),&Curve2D::interpolatef);
  546. //ObjectTypeDB::bind_method(_MD("bake","subdivs"),&Curve2D::bake,DEFVAL(10));
  547. ObjectTypeDB::bind_method(_MD("set_bake_interval","distance"),&Curve2D::set_bake_interval);
  548. ObjectTypeDB::bind_method(_MD("get_bake_interval"),&Curve2D::get_bake_interval);
  549. ObjectTypeDB::bind_method(_MD("get_baked_length"),&Curve2D::get_baked_length);
  550. ObjectTypeDB::bind_method(_MD("interpolate_baked","offset","cubic"),&Curve2D::interpolate_baked,DEFVAL(false));
  551. ObjectTypeDB::bind_method(_MD("get_baked_points"),&Curve2D::get_baked_points);
  552. ObjectTypeDB::bind_method(_MD("_get_data"),&Curve2D::_get_data);
  553. ObjectTypeDB::bind_method(_MD("_set_data"),&Curve2D::_set_data);
  554. ADD_PROPERTY( PropertyInfo( Variant::REAL, "bake_interval",PROPERTY_HINT_RANGE,"0.01,512,0.01"), _SCS("set_bake_interval"),_SCS("get_bake_interval"));
  555. ADD_PROPERTY( PropertyInfo( Variant::INT, "_data",PROPERTY_HINT_NONE,"",PROPERTY_USAGE_NOEDITOR), _SCS("_set_data"),_SCS("_get_data"));
  556. /*ADD_PROPERTY( PropertyInfo( Variant::VECTOR3_ARRAY, "points_out"), _SCS("set_points_out"),_SCS("get_points_out"));
  557. ADD_PROPERTY( PropertyInfo( Variant::VECTOR3_ARRAY, "points_pos"), _SCS("set_points_pos"),_SCS("get_points_pos"));
  558. */
  559. }
  560. Curve2D::Curve2D()
  561. {
  562. baked_cache_dirty=false;
  563. baked_max_ofs=0;
  564. /* add_point(Vector2(-1,0,0));
  565. add_point(Vector2(0,2,0));
  566. add_point(Vector2(0,3,5));*/
  567. bake_interval=5;
  568. }
  569. /***********************************************************************************/
  570. /***********************************************************************************/
  571. /***********************************************************************************/
  572. /***********************************************************************************/
  573. /***********************************************************************************/
  574. /***********************************************************************************/
  575. int Curve3D::get_point_count() const {
  576. return points.size();
  577. }
  578. void Curve3D::add_point(const Vector3& p_pos, const Vector3& p_in, const Vector3& p_out,int p_atpos) {
  579. Point n;
  580. n.pos=p_pos;
  581. n.in=p_in;
  582. n.out=p_out;
  583. if (p_atpos>=0 && p_atpos<points.size())
  584. points.insert(p_atpos,n);
  585. else
  586. points.push_back(n);
  587. baked_cache_dirty=true;
  588. emit_signal(CoreStringNames::get_singleton()->changed);
  589. }
  590. void Curve3D::set_point_pos(int p_index, const Vector3& p_pos) {
  591. ERR_FAIL_INDEX(p_index,points.size());
  592. points[p_index].pos=p_pos;
  593. baked_cache_dirty=true;
  594. emit_signal(CoreStringNames::get_singleton()->changed);
  595. }
  596. Vector3 Curve3D::get_point_pos(int p_index) const {
  597. ERR_FAIL_INDEX_V(p_index,points.size(),Vector3());
  598. return points[p_index].pos;
  599. }
  600. void Curve3D::set_point_tilt(int p_index, float p_tilt) {
  601. ERR_FAIL_INDEX(p_index,points.size());
  602. points[p_index].tilt=p_tilt;
  603. baked_cache_dirty=true;
  604. emit_signal(CoreStringNames::get_singleton()->changed);
  605. }
  606. float Curve3D::get_point_tilt(int p_index) const {
  607. ERR_FAIL_INDEX_V(p_index,points.size(),0);
  608. return points[p_index].tilt;
  609. }
  610. void Curve3D::set_point_in(int p_index, const Vector3& p_in) {
  611. ERR_FAIL_INDEX(p_index,points.size());
  612. points[p_index].in=p_in;
  613. baked_cache_dirty=true;
  614. emit_signal(CoreStringNames::get_singleton()->changed);
  615. }
  616. Vector3 Curve3D::get_point_in(int p_index) const {
  617. ERR_FAIL_INDEX_V(p_index,points.size(),Vector3());
  618. return points[p_index].in;
  619. }
  620. void Curve3D::set_point_out(int p_index, const Vector3& p_out) {
  621. ERR_FAIL_INDEX(p_index,points.size());
  622. points[p_index].out=p_out;
  623. baked_cache_dirty=true;
  624. emit_signal(CoreStringNames::get_singleton()->changed);
  625. }
  626. Vector3 Curve3D::get_point_out(int p_index) const {
  627. ERR_FAIL_INDEX_V(p_index,points.size(),Vector3());
  628. return points[p_index].out;
  629. }
  630. void Curve3D::remove_point(int p_index) {
  631. ERR_FAIL_INDEX(p_index,points.size());
  632. points.remove(p_index);
  633. baked_cache_dirty=true;
  634. emit_signal(CoreStringNames::get_singleton()->changed);
  635. }
  636. Vector3 Curve3D::interpolate(int p_index, float p_offset) const {
  637. int pc = points.size();
  638. ERR_FAIL_COND_V(pc==0,Vector3());
  639. if (p_index >= pc-1)
  640. return points[pc-1].pos;
  641. else if (p_index<0)
  642. return points[0].pos;
  643. Vector3 p0 = points[p_index].pos;
  644. Vector3 p1 = p0+points[p_index].out;
  645. Vector3 p3 = points[p_index+1].pos;
  646. Vector3 p2 = p3+points[p_index+1].in;
  647. return _bezier_interp(p_offset,p0,p1,p2,p3);
  648. }
  649. Vector3 Curve3D::interpolatef(real_t p_findex) const {
  650. if (p_findex>0)
  651. p_findex=0;
  652. else if (p_findex>=points.size())
  653. p_findex=points.size();
  654. return interpolate((int)p_findex,Math::fmod(p_findex,1.0));
  655. }
  656. void Curve3D::_bake_segment3d(Map<float,Vector3>& r_bake, float p_begin, float p_end,const Vector3& p_a,const Vector3& p_out,const Vector3& p_b, const Vector3& p_in,int p_depth,int p_max_depth,float p_tol) const {
  657. float mp = p_begin+(p_end-p_begin)*0.5;
  658. Vector3 beg = _bezier_interp(p_begin,p_a,p_a+p_out,p_b+p_in,p_b);
  659. Vector3 mid = _bezier_interp(mp,p_a,p_a+p_out,p_b+p_in,p_b);
  660. Vector3 end = _bezier_interp(p_end,p_a,p_a+p_out,p_b+p_in,p_b);
  661. Vector3 na = (mid-beg).normalized();
  662. Vector3 nb = (end-mid).normalized();
  663. float dp = na.dot(nb);
  664. if (dp<Math::cos(Math::deg2rad(p_tol))) {
  665. r_bake[mp]=mid;
  666. }
  667. if (p_depth<p_max_depth) {
  668. _bake_segment3d(r_bake,p_begin,mp,p_a,p_out,p_b,p_in,p_depth+1,p_max_depth,p_tol);
  669. _bake_segment3d(r_bake,mp,p_end,p_a,p_out,p_b,p_in,p_depth+1,p_max_depth,p_tol);
  670. }
  671. }
  672. void Curve3D::_bake() const {
  673. if (!baked_cache_dirty)
  674. return;
  675. baked_max_ofs=0;
  676. baked_cache_dirty=false;
  677. if (points.size()==0) {
  678. baked_point_cache.resize(0);
  679. baked_tilt_cache.resize(0);
  680. return;
  681. }
  682. if (points.size()==1) {
  683. baked_point_cache.resize(1);
  684. baked_point_cache.set(0,points[0].pos);
  685. baked_tilt_cache.resize(1);
  686. baked_tilt_cache.set(0,points[0].tilt);
  687. return;
  688. }
  689. Vector3 pos=points[0].pos;
  690. int point=0;
  691. float ofs=0;
  692. List<Plane> pointlist;
  693. pointlist.push_back(Plane(pos,points[0].tilt));
  694. for(int i=0;i<points.size()-1;i++) {
  695. float slen=points[i].pos.distance_to(points[i+1].pos);
  696. float divs = slen / bake_interval;
  697. if (divs>1)
  698. divs=1;
  699. float step = divs*0.1; // 10 substeps ought to be enough?
  700. float p = 0;
  701. while(p<1.0) {
  702. float np=p+step;
  703. if (np>1.0)
  704. np=1.0;
  705. Vector3 npp = _bezier_interp(np, points[i].pos,points[i].pos+points[i].out,points[i+1].pos+points[i+1].in,points[i+1].pos);
  706. float d = pos.distance_to(npp);
  707. if (d>bake_interval) {
  708. // OK! between P and NP there _has_ to be Something, let's go searching!
  709. int iterations = 10; //lots of detail!
  710. float low = p;
  711. float hi = np;
  712. float mid = low+(hi-low)*0.5;
  713. for(int j=0;j<iterations;j++) {
  714. npp = _bezier_interp(mid, points[i].pos,points[i].pos+points[i].out,points[i+1].pos+points[i+1].in,points[i+1].pos);
  715. d = pos.distance_to(npp);
  716. if (bake_interval < d)
  717. hi=mid;
  718. else
  719. low=mid;
  720. mid = low+(hi-low)*0.5;
  721. }
  722. pos=npp;
  723. p=mid;
  724. Plane post;
  725. post.normal=pos;
  726. post.d=Math::lerp(points[i].tilt,points[i+1].tilt,mid);
  727. pointlist.push_back(post);
  728. } else {
  729. p=np;
  730. }
  731. }
  732. }
  733. Vector3 lastpos = points[points.size()-1].pos;
  734. float lastilt = points[points.size()-1].tilt;
  735. float rem = pos.distance_to(lastpos);
  736. baked_max_ofs=(pointlist.size()-1)*bake_interval+rem;
  737. pointlist.push_back(Plane(lastpos,lastilt));
  738. baked_point_cache.resize(pointlist.size());
  739. Vector3Array::Write w = baked_point_cache.write();
  740. int idx=0;
  741. baked_tilt_cache.resize(pointlist.size());
  742. RealArray::Write wt = baked_tilt_cache.write();
  743. for(List<Plane>::Element *E=pointlist.front();E;E=E->next()) {
  744. w[idx]=E->get().normal;
  745. wt[idx]=E->get().d;
  746. idx++;
  747. }
  748. }
  749. float Curve3D::get_baked_length() const {
  750. if (baked_cache_dirty)
  751. _bake();
  752. return baked_max_ofs;
  753. }
  754. Vector3 Curve3D::interpolate_baked(float p_offset,bool p_cubic) const{
  755. if (baked_cache_dirty)
  756. _bake();
  757. //validate//
  758. int pc = baked_point_cache.size();
  759. if (pc==0) {
  760. ERR_EXPLAIN("No points in Curve3D");
  761. ERR_FAIL_COND_V(pc==0,Vector3());
  762. }
  763. if (pc==1)
  764. return baked_point_cache.get(0);
  765. int bpc=baked_point_cache.size();
  766. Vector3Array::Read r = baked_point_cache.read();
  767. if (p_offset<0)
  768. return r[0];
  769. if (p_offset>=baked_max_ofs)
  770. return r[bpc-1];
  771. int idx = Math::floor(p_offset/bake_interval);
  772. float frac = Math::fmod(p_offset,bake_interval);
  773. if (idx>=bpc-1) {
  774. return r[bpc-1];
  775. } else if (idx==bpc-2) {
  776. frac/=Math::fmod(baked_max_ofs,bake_interval);
  777. } else {
  778. frac/=bake_interval;
  779. }
  780. if (p_cubic) {
  781. Vector3 pre = idx>0? r[idx-1] : r[idx];
  782. Vector3 post = (idx<(bpc-2))? r[idx+2] : r[idx+1];
  783. return r[idx].cubic_interpolate(r[idx+1],pre,post,frac);
  784. } else {
  785. return r[idx].linear_interpolate(r[idx+1],frac);
  786. }
  787. }
  788. float Curve3D::interpolate_baked_tilt(float p_offset) const{
  789. if (baked_cache_dirty)
  790. _bake();
  791. //validate//
  792. int pc = baked_tilt_cache.size();
  793. if (pc==0) {
  794. ERR_EXPLAIN("No tilts in Curve3D");
  795. ERR_FAIL_COND_V(pc==0,0);
  796. }
  797. if (pc==1)
  798. return baked_tilt_cache.get(0);
  799. int bpc=baked_tilt_cache.size();
  800. RealArray::Read r = baked_tilt_cache.read();
  801. if (p_offset<0)
  802. return r[0];
  803. if (p_offset>=baked_max_ofs)
  804. return r[bpc-1];
  805. int idx = Math::floor(p_offset/bake_interval);
  806. float frac = Math::fmod(p_offset,bake_interval);
  807. if (idx>=bpc-1) {
  808. return r[bpc-1];
  809. } else if (idx==bpc-2) {
  810. frac/=Math::fmod(baked_max_ofs,bake_interval);
  811. } else {
  812. frac/=bake_interval;
  813. }
  814. return Math::lerp(r[idx],r[idx+1],frac);
  815. }
  816. Vector3Array Curve3D::get_baked_points() const {
  817. if (baked_cache_dirty)
  818. _bake();
  819. return baked_point_cache;
  820. }
  821. RealArray Curve3D::get_baked_tilts() const {
  822. if (baked_cache_dirty)
  823. _bake();
  824. return baked_tilt_cache;
  825. }
  826. void Curve3D::set_bake_interval(float p_tolerance){
  827. bake_interval=p_tolerance;
  828. baked_cache_dirty=true;
  829. emit_signal(CoreStringNames::get_singleton()->changed);
  830. }
  831. float Curve3D::get_bake_interval() const{
  832. return bake_interval;
  833. }
  834. Dictionary Curve3D::_get_data() const {
  835. Dictionary dc;
  836. Vector3Array d;
  837. d.resize(points.size()*3);
  838. Vector3Array::Write w = d.write();
  839. RealArray t;
  840. t.resize(points.size());
  841. RealArray::Write wt = t.write();
  842. for(int i=0;i<points.size();i++) {
  843. w[i*3+0]=points[i].in;
  844. w[i*3+1]=points[i].out;
  845. w[i*3+2]=points[i].pos;
  846. wt[i]=points[i].tilt;
  847. }
  848. w=Vector3Array::Write();
  849. wt=RealArray::Write();
  850. dc["points"]=d;
  851. dc["tilts"]=t;
  852. return dc;
  853. }
  854. void Curve3D::_set_data(const Dictionary& p_data){
  855. ERR_FAIL_COND(!p_data.has("points"));
  856. ERR_FAIL_COND(!p_data.has("tilts"));
  857. Vector3Array rp=p_data["points"];
  858. int pc = rp.size();
  859. ERR_FAIL_COND(pc%3!=0);
  860. points.resize(pc/3);
  861. Vector3Array::Read r = rp.read();
  862. RealArray rtl=p_data["tilts"];
  863. RealArray::Read rt=rtl.read();
  864. for(int i=0;i<points.size();i++) {
  865. points[i].in=r[i*3+0];
  866. points[i].out=r[i*3+1];
  867. points[i].pos=r[i*3+2];
  868. points[i].tilt=rt[i];
  869. }
  870. baked_cache_dirty=true;
  871. }
  872. Vector3Array Curve3D::tesselate(int p_max_stages,float p_tolerance) const {
  873. Vector3Array tess;
  874. if (points.size()==0) {
  875. return tess;
  876. }
  877. Vector< Map<float,Vector3> > midpoints;
  878. midpoints.resize(points.size()-1);
  879. int pc=1;
  880. for(int i=0;i<points.size()-1;i++) {
  881. _bake_segment3d(midpoints[i],0,1,points[i].pos,points[i].out,points[i+1].pos,points[i+1].in,0,p_max_stages,p_tolerance);
  882. pc++;
  883. pc+=midpoints[i].size();
  884. }
  885. tess.resize(pc);
  886. Vector3Array::Write bpw=tess.write();
  887. bpw[0]=points[0].pos;
  888. int pidx=0;
  889. for(int i=0;i<points.size()-1;i++) {
  890. for(Map<float,Vector3>::Element *E=midpoints[i].front();E;E=E->next()) {
  891. pidx++;
  892. bpw[pidx] = E->get();
  893. }
  894. pidx++;
  895. bpw[pidx] = points[i+1].pos;
  896. }
  897. bpw=Vector3Array::Write ();
  898. return tess;
  899. }
  900. void Curve3D::_bind_methods() {
  901. ObjectTypeDB::bind_method(_MD("get_point_count"),&Curve3D::get_point_count);
  902. ObjectTypeDB::bind_method(_MD("add_point","pos","in","out","atpos"),&Curve3D::add_point,DEFVAL(Vector3()),DEFVAL(Vector3()),DEFVAL(-1));
  903. ObjectTypeDB::bind_method(_MD("set_point_pos","idx","pos"),&Curve3D::set_point_pos);
  904. ObjectTypeDB::bind_method(_MD("get_point_pos","idx"),&Curve3D::get_point_pos);
  905. ObjectTypeDB::bind_method(_MD("set_point_tilt","idx","tilt"),&Curve3D::set_point_tilt);
  906. ObjectTypeDB::bind_method(_MD("get_point_tilt","idx"),&Curve3D::get_point_tilt);
  907. ObjectTypeDB::bind_method(_MD("set_point_in","idx","pos"),&Curve3D::set_point_in);
  908. ObjectTypeDB::bind_method(_MD("get_point_in","idx"),&Curve3D::get_point_in);
  909. ObjectTypeDB::bind_method(_MD("set_point_out","idx","pos"),&Curve3D::set_point_out);
  910. ObjectTypeDB::bind_method(_MD("get_point_out","idx"),&Curve3D::get_point_out);
  911. ObjectTypeDB::bind_method(_MD("remove_point","idx"),&Curve3D::remove_point);
  912. ObjectTypeDB::bind_method(_MD("interpolate","idx","t"),&Curve3D::interpolate);
  913. ObjectTypeDB::bind_method(_MD("interpolatef","fofs"),&Curve3D::interpolatef);
  914. //ObjectTypeDB::bind_method(_MD("bake","subdivs"),&Curve3D::bake,DEFVAL(10));
  915. ObjectTypeDB::bind_method(_MD("set_bake_interval","distance"),&Curve3D::set_bake_interval);
  916. ObjectTypeDB::bind_method(_MD("get_bake_interval"),&Curve3D::get_bake_interval);
  917. ObjectTypeDB::bind_method(_MD("get_baked_length"),&Curve3D::get_baked_length);
  918. ObjectTypeDB::bind_method(_MD("interpolate_baked","offset","cubic"),&Curve3D::interpolate_baked,DEFVAL(false));
  919. ObjectTypeDB::bind_method(_MD("get_baked_points"),&Curve3D::get_baked_points);
  920. ObjectTypeDB::bind_method(_MD("get_baked_tilts"),&Curve3D::get_baked_tilts);
  921. ObjectTypeDB::bind_method(_MD("_get_data"),&Curve3D::_get_data);
  922. ObjectTypeDB::bind_method(_MD("_set_data"),&Curve3D::_set_data);
  923. ADD_PROPERTY( PropertyInfo( Variant::REAL, "bake_interval",PROPERTY_HINT_RANGE,"0.01,512,0.01"), _SCS("set_bake_interval"),_SCS("get_bake_interval"));
  924. ADD_PROPERTY( PropertyInfo( Variant::INT, "_data",PROPERTY_HINT_NONE,"",PROPERTY_USAGE_NOEDITOR), _SCS("_set_data"),_SCS("_get_data"));
  925. /*ADD_PROPERTY( PropertyInfo( Variant::VECTOR3_ARRAY, "points_out"), _SCS("set_points_out"),_SCS("get_points_out"));
  926. ADD_PROPERTY( PropertyInfo( Variant::VECTOR3_ARRAY, "points_pos"), _SCS("set_points_pos"),_SCS("get_points_pos"));
  927. */
  928. }
  929. Curve3D::Curve3D()
  930. {
  931. baked_cache_dirty=false;
  932. baked_max_ofs=0;
  933. /* add_point(Vector3(-1,0,0));
  934. add_point(Vector3(0,2,0));
  935. add_point(Vector3(0,3,5));*/
  936. bake_interval=0.2;
  937. }