curve.cpp 33 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394
  1. /*************************************************************************/
  2. /* curve.cpp */
  3. /*************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* http://www.godotengine.org */
  7. /*************************************************************************/
  8. /* Copyright (c) 2007-2016 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. void Curve2D::clear_points() {
  325. if (!points.empty()) {
  326. points.clear();
  327. baked_cache_dirty=true;
  328. emit_signal(CoreStringNames::get_singleton()->changed);
  329. }
  330. }
  331. Vector2 Curve2D::interpolate(int p_index, float p_offset) const {
  332. int pc = points.size();
  333. ERR_FAIL_COND_V(pc==0,Vector2());
  334. if (p_index >= pc-1)
  335. return points[pc-1].pos;
  336. else if (p_index<0)
  337. return points[0].pos;
  338. Vector2 p0 = points[p_index].pos;
  339. Vector2 p1 = p0+points[p_index].out;
  340. Vector2 p3 = points[p_index+1].pos;
  341. Vector2 p2 = p3+points[p_index+1].in;
  342. return _bezier_interp(p_offset,p0,p1,p2,p3);
  343. }
  344. Vector2 Curve2D::interpolatef(real_t p_findex) const {
  345. if (p_findex<0)
  346. p_findex=0;
  347. else if (p_findex>=points.size())
  348. p_findex=points.size();
  349. return interpolate((int)p_findex,Math::fmod(p_findex,1.0));
  350. }
  351. 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 {
  352. float mp = p_begin+(p_end-p_begin)*0.5;
  353. Vector2 beg = _bezier_interp(p_begin,p_a,p_a+p_out,p_b+p_in,p_b);
  354. Vector2 mid = _bezier_interp(mp,p_a,p_a+p_out,p_b+p_in,p_b);
  355. Vector2 end = _bezier_interp(p_end,p_a,p_a+p_out,p_b+p_in,p_b);
  356. Vector2 na = (mid-beg).normalized();
  357. Vector2 nb = (end-mid).normalized();
  358. float dp = na.dot(nb);
  359. if (dp<Math::cos(Math::deg2rad(p_tol))) {
  360. r_bake[mp]=mid;
  361. }
  362. if (p_depth<p_max_depth) {
  363. _bake_segment2d(r_bake,p_begin,mp,p_a,p_out,p_b,p_in,p_depth+1,p_max_depth,p_tol);
  364. _bake_segment2d(r_bake,mp,p_end,p_a,p_out,p_b,p_in,p_depth+1,p_max_depth,p_tol);
  365. }
  366. }
  367. void Curve2D::_bake() const {
  368. if (!baked_cache_dirty)
  369. return;
  370. baked_max_ofs=0;
  371. baked_cache_dirty=false;
  372. if (points.size()==0) {
  373. baked_point_cache.resize(0);
  374. return;
  375. }
  376. if (points.size()==1) {
  377. baked_point_cache.resize(1);
  378. baked_point_cache.set(0,points[0].pos);
  379. return;
  380. }
  381. Vector2 pos=points[0].pos;
  382. List<Vector2> pointlist;
  383. pointlist.push_back(pos); //start always from origin
  384. for(int i=0;i<points.size()-1;i++) {
  385. float step = 0.1; // at least 10 substeps ought to be enough?
  386. float p = 0;
  387. while(p<1.0) {
  388. float np=p+step;
  389. if (np>1.0)
  390. np=1.0;
  391. 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);
  392. float d = pos.distance_to(npp);
  393. if (d>bake_interval) {
  394. // OK! between P and NP there _has_ to be Something, let's go searching!
  395. int iterations = 10; //lots of detail!
  396. float low = p;
  397. float hi = np;
  398. float mid = low+(hi-low)*0.5;
  399. for(int j=0;j<iterations;j++) {
  400. 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);
  401. d = pos.distance_to(npp);
  402. if (bake_interval < d)
  403. hi=mid;
  404. else
  405. low=mid;
  406. mid = low+(hi-low)*0.5;
  407. }
  408. pos=npp;
  409. p=mid;
  410. pointlist.push_back(pos);
  411. } else {
  412. p=np;
  413. }
  414. }
  415. }
  416. Vector2 lastpos = points[points.size()-1].pos;
  417. float rem = pos.distance_to(lastpos);
  418. baked_max_ofs=(pointlist.size()-1)*bake_interval+rem;
  419. pointlist.push_back(lastpos);
  420. baked_point_cache.resize(pointlist.size());
  421. Vector2Array::Write w = baked_point_cache.write();
  422. int idx=0;
  423. for(List<Vector2>::Element *E=pointlist.front();E;E=E->next()) {
  424. w[idx]=E->get();
  425. idx++;
  426. }
  427. }
  428. float Curve2D::get_baked_length() const {
  429. if (baked_cache_dirty)
  430. _bake();
  431. return baked_max_ofs;
  432. }
  433. Vector2 Curve2D::interpolate_baked(float p_offset,bool p_cubic) const{
  434. if (baked_cache_dirty)
  435. _bake();
  436. //validate//
  437. int pc = baked_point_cache.size();
  438. if (pc==0) {
  439. ERR_EXPLAIN("No points in Curve2D");
  440. ERR_FAIL_COND_V(pc==0,Vector2());
  441. }
  442. if (pc==1)
  443. return baked_point_cache.get(0);
  444. int bpc=baked_point_cache.size();
  445. Vector2Array::Read r = baked_point_cache.read();
  446. if (p_offset<0)
  447. return r[0];
  448. if (p_offset>=baked_max_ofs)
  449. return r[bpc-1];
  450. int idx = Math::floor((double)p_offset/(double)bake_interval);
  451. float frac = Math::fmod(p_offset,bake_interval);
  452. if (idx>=bpc-1) {
  453. return r[bpc-1];
  454. } else if (idx==bpc-2) {
  455. frac/=Math::fmod(baked_max_ofs,bake_interval);
  456. } else {
  457. frac/=bake_interval;
  458. }
  459. if (p_cubic) {
  460. Vector2 pre = idx>0? r[idx-1] : r[idx];
  461. Vector2 post = (idx<(bpc-2))? r[idx+2] : r[idx+1];
  462. return r[idx].cubic_interpolate(r[idx+1],pre,post,frac);
  463. } else {
  464. return r[idx].linear_interpolate(r[idx+1],frac);
  465. }
  466. }
  467. Vector2Array Curve2D::get_baked_points() const {
  468. if (baked_cache_dirty)
  469. _bake();
  470. return baked_point_cache;
  471. }
  472. void Curve2D::set_bake_interval(float p_tolerance){
  473. bake_interval=p_tolerance;
  474. baked_cache_dirty=true;
  475. emit_signal(CoreStringNames::get_singleton()->changed);
  476. }
  477. float Curve2D::get_bake_interval() const{
  478. return bake_interval;
  479. }
  480. Dictionary Curve2D::_get_data() const {
  481. Dictionary dc;
  482. Vector2Array d;
  483. d.resize(points.size()*3);
  484. Vector2Array::Write w = d.write();
  485. for(int i=0;i<points.size();i++) {
  486. w[i*3+0]=points[i].in;
  487. w[i*3+1]=points[i].out;
  488. w[i*3+2]=points[i].pos;
  489. }
  490. w=Vector2Array::Write();
  491. dc["points"]=d;
  492. return dc;
  493. }
  494. void Curve2D::_set_data(const Dictionary& p_data){
  495. ERR_FAIL_COND(!p_data.has("points"));
  496. Vector2Array rp=p_data["points"];
  497. int pc = rp.size();
  498. ERR_FAIL_COND(pc%3!=0);
  499. points.resize(pc/3);
  500. Vector2Array::Read r = rp.read();
  501. for(int i=0;i<points.size();i++) {
  502. points[i].in=r[i*3+0];
  503. points[i].out=r[i*3+1];
  504. points[i].pos=r[i*3+2];
  505. }
  506. baked_cache_dirty=true;
  507. }
  508. Vector2Array Curve2D::tesselate(int p_max_stages,float p_tolerance) const {
  509. Vector2Array tess;
  510. if (points.size()==0) {
  511. return tess;
  512. }
  513. Vector< Map<float,Vector2> > midpoints;
  514. midpoints.resize(points.size()-1);
  515. int pc=1;
  516. for(int i=0;i<points.size()-1;i++) {
  517. _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);
  518. pc++;
  519. pc+=midpoints[i].size();
  520. }
  521. tess.resize(pc);
  522. Vector2Array::Write bpw=tess.write();
  523. bpw[0]=points[0].pos;
  524. int pidx=0;
  525. for(int i=0;i<points.size()-1;i++) {
  526. for(Map<float,Vector2>::Element *E=midpoints[i].front();E;E=E->next()) {
  527. pidx++;
  528. bpw[pidx] = E->get();
  529. }
  530. pidx++;
  531. bpw[pidx] = points[i+1].pos;
  532. }
  533. bpw=Vector2Array::Write ();
  534. return tess;
  535. }
  536. void Curve2D::_bind_methods() {
  537. ObjectTypeDB::bind_method(_MD("get_point_count"),&Curve2D::get_point_count);
  538. ObjectTypeDB::bind_method(_MD("add_point","pos","in","out","atpos"),&Curve2D::add_point,DEFVAL(Vector2()),DEFVAL(Vector2()),DEFVAL(-1));
  539. ObjectTypeDB::bind_method(_MD("set_point_pos","idx","pos"),&Curve2D::set_point_pos);
  540. ObjectTypeDB::bind_method(_MD("get_point_pos","idx"),&Curve2D::get_point_pos);
  541. ObjectTypeDB::bind_method(_MD("set_point_in","idx","pos"),&Curve2D::set_point_in);
  542. ObjectTypeDB::bind_method(_MD("get_point_in","idx"),&Curve2D::get_point_in);
  543. ObjectTypeDB::bind_method(_MD("set_point_out","idx","pos"),&Curve2D::set_point_out);
  544. ObjectTypeDB::bind_method(_MD("get_point_out","idx"),&Curve2D::get_point_out);
  545. ObjectTypeDB::bind_method(_MD("remove_point","idx"),&Curve2D::remove_point);
  546. ObjectTypeDB::bind_method(_MD("clear_points"),&Curve2D::clear_points);
  547. ObjectTypeDB::bind_method(_MD("interpolate","idx","t"),&Curve2D::interpolate);
  548. ObjectTypeDB::bind_method(_MD("interpolatef","fofs"),&Curve2D::interpolatef);
  549. //ObjectTypeDB::bind_method(_MD("bake","subdivs"),&Curve2D::bake,DEFVAL(10));
  550. ObjectTypeDB::bind_method(_MD("set_bake_interval","distance"),&Curve2D::set_bake_interval);
  551. ObjectTypeDB::bind_method(_MD("get_bake_interval"),&Curve2D::get_bake_interval);
  552. ObjectTypeDB::bind_method(_MD("get_baked_length"),&Curve2D::get_baked_length);
  553. ObjectTypeDB::bind_method(_MD("interpolate_baked","offset","cubic"),&Curve2D::interpolate_baked,DEFVAL(false));
  554. ObjectTypeDB::bind_method(_MD("get_baked_points"),&Curve2D::get_baked_points);
  555. ObjectTypeDB::bind_method(_MD("tesselate","max_stages","tolerance_degrees"),&Curve2D::tesselate,DEFVAL(5),DEFVAL(4));
  556. ObjectTypeDB::bind_method(_MD("_get_data"),&Curve2D::_get_data);
  557. ObjectTypeDB::bind_method(_MD("_set_data"),&Curve2D::_set_data);
  558. ADD_PROPERTY( PropertyInfo( Variant::REAL, "bake_interval",PROPERTY_HINT_RANGE,"0.01,512,0.01"), _SCS("set_bake_interval"),_SCS("get_bake_interval"));
  559. ADD_PROPERTY( PropertyInfo( Variant::INT, "_data",PROPERTY_HINT_NONE,"",PROPERTY_USAGE_NOEDITOR), _SCS("_set_data"),_SCS("_get_data"));
  560. /*ADD_PROPERTY( PropertyInfo( Variant::VECTOR3_ARRAY, "points_out"), _SCS("set_points_out"),_SCS("get_points_out"));
  561. ADD_PROPERTY( PropertyInfo( Variant::VECTOR3_ARRAY, "points_pos"), _SCS("set_points_pos"),_SCS("get_points_pos"));
  562. */
  563. }
  564. Curve2D::Curve2D()
  565. {
  566. baked_cache_dirty=false;
  567. baked_max_ofs=0;
  568. /* add_point(Vector2(-1,0,0));
  569. add_point(Vector2(0,2,0));
  570. add_point(Vector2(0,3,5));*/
  571. bake_interval=5;
  572. }
  573. /***********************************************************************************/
  574. /***********************************************************************************/
  575. /***********************************************************************************/
  576. /***********************************************************************************/
  577. /***********************************************************************************/
  578. /***********************************************************************************/
  579. int Curve3D::get_point_count() const {
  580. return points.size();
  581. }
  582. void Curve3D::add_point(const Vector3& p_pos, const Vector3& p_in, const Vector3& p_out,int p_atpos) {
  583. Point n;
  584. n.pos=p_pos;
  585. n.in=p_in;
  586. n.out=p_out;
  587. if (p_atpos>=0 && p_atpos<points.size())
  588. points.insert(p_atpos,n);
  589. else
  590. points.push_back(n);
  591. baked_cache_dirty=true;
  592. emit_signal(CoreStringNames::get_singleton()->changed);
  593. }
  594. void Curve3D::set_point_pos(int p_index, const Vector3& p_pos) {
  595. ERR_FAIL_INDEX(p_index,points.size());
  596. points[p_index].pos=p_pos;
  597. baked_cache_dirty=true;
  598. emit_signal(CoreStringNames::get_singleton()->changed);
  599. }
  600. Vector3 Curve3D::get_point_pos(int p_index) const {
  601. ERR_FAIL_INDEX_V(p_index,points.size(),Vector3());
  602. return points[p_index].pos;
  603. }
  604. void Curve3D::set_point_tilt(int p_index, float p_tilt) {
  605. ERR_FAIL_INDEX(p_index,points.size());
  606. points[p_index].tilt=p_tilt;
  607. baked_cache_dirty=true;
  608. emit_signal(CoreStringNames::get_singleton()->changed);
  609. }
  610. float Curve3D::get_point_tilt(int p_index) const {
  611. ERR_FAIL_INDEX_V(p_index,points.size(),0);
  612. return points[p_index].tilt;
  613. }
  614. void Curve3D::set_point_in(int p_index, const Vector3& p_in) {
  615. ERR_FAIL_INDEX(p_index,points.size());
  616. points[p_index].in=p_in;
  617. baked_cache_dirty=true;
  618. emit_signal(CoreStringNames::get_singleton()->changed);
  619. }
  620. Vector3 Curve3D::get_point_in(int p_index) const {
  621. ERR_FAIL_INDEX_V(p_index,points.size(),Vector3());
  622. return points[p_index].in;
  623. }
  624. void Curve3D::set_point_out(int p_index, const Vector3& p_out) {
  625. ERR_FAIL_INDEX(p_index,points.size());
  626. points[p_index].out=p_out;
  627. baked_cache_dirty=true;
  628. emit_signal(CoreStringNames::get_singleton()->changed);
  629. }
  630. Vector3 Curve3D::get_point_out(int p_index) const {
  631. ERR_FAIL_INDEX_V(p_index,points.size(),Vector3());
  632. return points[p_index].out;
  633. }
  634. void Curve3D::remove_point(int p_index) {
  635. ERR_FAIL_INDEX(p_index,points.size());
  636. points.remove(p_index);
  637. baked_cache_dirty=true;
  638. emit_signal(CoreStringNames::get_singleton()->changed);
  639. }
  640. void Curve3D::clear_points() {
  641. if (!points.empty()) {
  642. points.clear();
  643. baked_cache_dirty=true;
  644. emit_signal(CoreStringNames::get_singleton()->changed);
  645. }
  646. }
  647. Vector3 Curve3D::interpolate(int p_index, float p_offset) const {
  648. int pc = points.size();
  649. ERR_FAIL_COND_V(pc==0,Vector3());
  650. if (p_index >= pc-1)
  651. return points[pc-1].pos;
  652. else if (p_index<0)
  653. return points[0].pos;
  654. Vector3 p0 = points[p_index].pos;
  655. Vector3 p1 = p0+points[p_index].out;
  656. Vector3 p3 = points[p_index+1].pos;
  657. Vector3 p2 = p3+points[p_index+1].in;
  658. return _bezier_interp(p_offset,p0,p1,p2,p3);
  659. }
  660. Vector3 Curve3D::interpolatef(real_t p_findex) const {
  661. if (p_findex<0)
  662. p_findex=0;
  663. else if (p_findex>=points.size())
  664. p_findex=points.size();
  665. return interpolate((int)p_findex,Math::fmod(p_findex,1.0));
  666. }
  667. 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 {
  668. float mp = p_begin+(p_end-p_begin)*0.5;
  669. Vector3 beg = _bezier_interp(p_begin,p_a,p_a+p_out,p_b+p_in,p_b);
  670. Vector3 mid = _bezier_interp(mp,p_a,p_a+p_out,p_b+p_in,p_b);
  671. Vector3 end = _bezier_interp(p_end,p_a,p_a+p_out,p_b+p_in,p_b);
  672. Vector3 na = (mid-beg).normalized();
  673. Vector3 nb = (end-mid).normalized();
  674. float dp = na.dot(nb);
  675. if (dp<Math::cos(Math::deg2rad(p_tol))) {
  676. r_bake[mp]=mid;
  677. }
  678. if (p_depth<p_max_depth) {
  679. _bake_segment3d(r_bake,p_begin,mp,p_a,p_out,p_b,p_in,p_depth+1,p_max_depth,p_tol);
  680. _bake_segment3d(r_bake,mp,p_end,p_a,p_out,p_b,p_in,p_depth+1,p_max_depth,p_tol);
  681. }
  682. }
  683. void Curve3D::_bake() const {
  684. if (!baked_cache_dirty)
  685. return;
  686. baked_max_ofs=0;
  687. baked_cache_dirty=false;
  688. if (points.size()==0) {
  689. baked_point_cache.resize(0);
  690. baked_tilt_cache.resize(0);
  691. return;
  692. }
  693. if (points.size()==1) {
  694. baked_point_cache.resize(1);
  695. baked_point_cache.set(0,points[0].pos);
  696. baked_tilt_cache.resize(1);
  697. baked_tilt_cache.set(0,points[0].tilt);
  698. return;
  699. }
  700. Vector3 pos=points[0].pos;
  701. List<Plane> pointlist;
  702. pointlist.push_back(Plane(pos,points[0].tilt));
  703. for(int i=0;i<points.size()-1;i++) {
  704. float step = 0.1; // at least 10 substeps ought to be enough?
  705. float p = 0;
  706. while(p<1.0) {
  707. float np=p+step;
  708. if (np>1.0)
  709. np=1.0;
  710. 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);
  711. float d = pos.distance_to(npp);
  712. if (d>bake_interval) {
  713. // OK! between P and NP there _has_ to be Something, let's go searching!
  714. int iterations = 10; //lots of detail!
  715. float low = p;
  716. float hi = np;
  717. float mid = low+(hi-low)*0.5;
  718. for(int j=0;j<iterations;j++) {
  719. 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);
  720. d = pos.distance_to(npp);
  721. if (bake_interval < d)
  722. hi=mid;
  723. else
  724. low=mid;
  725. mid = low+(hi-low)*0.5;
  726. }
  727. pos=npp;
  728. p=mid;
  729. Plane post;
  730. post.normal=pos;
  731. post.d=Math::lerp(points[i].tilt,points[i+1].tilt,mid);
  732. pointlist.push_back(post);
  733. } else {
  734. p=np;
  735. }
  736. }
  737. }
  738. Vector3 lastpos = points[points.size()-1].pos;
  739. float lastilt = points[points.size()-1].tilt;
  740. float rem = pos.distance_to(lastpos);
  741. baked_max_ofs=(pointlist.size()-1)*bake_interval+rem;
  742. pointlist.push_back(Plane(lastpos,lastilt));
  743. baked_point_cache.resize(pointlist.size());
  744. Vector3Array::Write w = baked_point_cache.write();
  745. int idx=0;
  746. baked_tilt_cache.resize(pointlist.size());
  747. RealArray::Write wt = baked_tilt_cache.write();
  748. for(List<Plane>::Element *E=pointlist.front();E;E=E->next()) {
  749. w[idx]=E->get().normal;
  750. wt[idx]=E->get().d;
  751. idx++;
  752. }
  753. }
  754. float Curve3D::get_baked_length() const {
  755. if (baked_cache_dirty)
  756. _bake();
  757. return baked_max_ofs;
  758. }
  759. Vector3 Curve3D::interpolate_baked(float p_offset,bool p_cubic) const{
  760. if (baked_cache_dirty)
  761. _bake();
  762. //validate//
  763. int pc = baked_point_cache.size();
  764. if (pc==0) {
  765. ERR_EXPLAIN("No points in Curve3D");
  766. ERR_FAIL_COND_V(pc==0,Vector3());
  767. }
  768. if (pc==1)
  769. return baked_point_cache.get(0);
  770. int bpc=baked_point_cache.size();
  771. Vector3Array::Read r = baked_point_cache.read();
  772. if (p_offset<0)
  773. return r[0];
  774. if (p_offset>=baked_max_ofs)
  775. return r[bpc-1];
  776. int idx = Math::floor((double)p_offset/(double)bake_interval);
  777. float frac = Math::fmod(p_offset,bake_interval);
  778. if (idx>=bpc-1) {
  779. return r[bpc-1];
  780. } else if (idx==bpc-2) {
  781. frac/=Math::fmod(baked_max_ofs,bake_interval);
  782. } else {
  783. frac/=bake_interval;
  784. }
  785. if (p_cubic) {
  786. Vector3 pre = idx>0? r[idx-1] : r[idx];
  787. Vector3 post = (idx<(bpc-2))? r[idx+2] : r[idx+1];
  788. return r[idx].cubic_interpolate(r[idx+1],pre,post,frac);
  789. } else {
  790. return r[idx].linear_interpolate(r[idx+1],frac);
  791. }
  792. }
  793. float Curve3D::interpolate_baked_tilt(float p_offset) const{
  794. if (baked_cache_dirty)
  795. _bake();
  796. //validate//
  797. int pc = baked_tilt_cache.size();
  798. if (pc==0) {
  799. ERR_EXPLAIN("No tilts in Curve3D");
  800. ERR_FAIL_COND_V(pc==0,0);
  801. }
  802. if (pc==1)
  803. return baked_tilt_cache.get(0);
  804. int bpc=baked_tilt_cache.size();
  805. RealArray::Read r = baked_tilt_cache.read();
  806. if (p_offset<0)
  807. return r[0];
  808. if (p_offset>=baked_max_ofs)
  809. return r[bpc-1];
  810. int idx = Math::floor((double)p_offset/(double)bake_interval);
  811. float frac = Math::fmod(p_offset,bake_interval);
  812. if (idx>=bpc-1) {
  813. return r[bpc-1];
  814. } else if (idx==bpc-2) {
  815. frac/=Math::fmod(baked_max_ofs,bake_interval);
  816. } else {
  817. frac/=bake_interval;
  818. }
  819. return Math::lerp(r[idx],r[idx+1],frac);
  820. }
  821. Vector3Array Curve3D::get_baked_points() const {
  822. if (baked_cache_dirty)
  823. _bake();
  824. return baked_point_cache;
  825. }
  826. RealArray Curve3D::get_baked_tilts() const {
  827. if (baked_cache_dirty)
  828. _bake();
  829. return baked_tilt_cache;
  830. }
  831. void Curve3D::set_bake_interval(float p_tolerance){
  832. bake_interval=p_tolerance;
  833. baked_cache_dirty=true;
  834. emit_signal(CoreStringNames::get_singleton()->changed);
  835. }
  836. float Curve3D::get_bake_interval() const{
  837. return bake_interval;
  838. }
  839. Dictionary Curve3D::_get_data() const {
  840. Dictionary dc;
  841. Vector3Array d;
  842. d.resize(points.size()*3);
  843. Vector3Array::Write w = d.write();
  844. RealArray t;
  845. t.resize(points.size());
  846. RealArray::Write wt = t.write();
  847. for(int i=0;i<points.size();i++) {
  848. w[i*3+0]=points[i].in;
  849. w[i*3+1]=points[i].out;
  850. w[i*3+2]=points[i].pos;
  851. wt[i]=points[i].tilt;
  852. }
  853. w=Vector3Array::Write();
  854. wt=RealArray::Write();
  855. dc["points"]=d;
  856. dc["tilts"]=t;
  857. return dc;
  858. }
  859. void Curve3D::_set_data(const Dictionary& p_data){
  860. ERR_FAIL_COND(!p_data.has("points"));
  861. ERR_FAIL_COND(!p_data.has("tilts"));
  862. Vector3Array rp=p_data["points"];
  863. int pc = rp.size();
  864. ERR_FAIL_COND(pc%3!=0);
  865. points.resize(pc/3);
  866. Vector3Array::Read r = rp.read();
  867. RealArray rtl=p_data["tilts"];
  868. RealArray::Read rt=rtl.read();
  869. for(int i=0;i<points.size();i++) {
  870. points[i].in=r[i*3+0];
  871. points[i].out=r[i*3+1];
  872. points[i].pos=r[i*3+2];
  873. points[i].tilt=rt[i];
  874. }
  875. baked_cache_dirty=true;
  876. }
  877. Vector3Array Curve3D::tesselate(int p_max_stages,float p_tolerance) const {
  878. Vector3Array tess;
  879. if (points.size()==0) {
  880. return tess;
  881. }
  882. Vector< Map<float,Vector3> > midpoints;
  883. midpoints.resize(points.size()-1);
  884. int pc=1;
  885. for(int i=0;i<points.size()-1;i++) {
  886. _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);
  887. pc++;
  888. pc+=midpoints[i].size();
  889. }
  890. tess.resize(pc);
  891. Vector3Array::Write bpw=tess.write();
  892. bpw[0]=points[0].pos;
  893. int pidx=0;
  894. for(int i=0;i<points.size()-1;i++) {
  895. for(Map<float,Vector3>::Element *E=midpoints[i].front();E;E=E->next()) {
  896. pidx++;
  897. bpw[pidx] = E->get();
  898. }
  899. pidx++;
  900. bpw[pidx] = points[i+1].pos;
  901. }
  902. bpw=Vector3Array::Write ();
  903. return tess;
  904. }
  905. void Curve3D::_bind_methods() {
  906. ObjectTypeDB::bind_method(_MD("get_point_count"),&Curve3D::get_point_count);
  907. ObjectTypeDB::bind_method(_MD("add_point","pos","in","out","atpos"),&Curve3D::add_point,DEFVAL(Vector3()),DEFVAL(Vector3()),DEFVAL(-1));
  908. ObjectTypeDB::bind_method(_MD("set_point_pos","idx","pos"),&Curve3D::set_point_pos);
  909. ObjectTypeDB::bind_method(_MD("get_point_pos","idx"),&Curve3D::get_point_pos);
  910. ObjectTypeDB::bind_method(_MD("set_point_tilt","idx","tilt"),&Curve3D::set_point_tilt);
  911. ObjectTypeDB::bind_method(_MD("get_point_tilt","idx"),&Curve3D::get_point_tilt);
  912. ObjectTypeDB::bind_method(_MD("set_point_in","idx","pos"),&Curve3D::set_point_in);
  913. ObjectTypeDB::bind_method(_MD("get_point_in","idx"),&Curve3D::get_point_in);
  914. ObjectTypeDB::bind_method(_MD("set_point_out","idx","pos"),&Curve3D::set_point_out);
  915. ObjectTypeDB::bind_method(_MD("get_point_out","idx"),&Curve3D::get_point_out);
  916. ObjectTypeDB::bind_method(_MD("remove_point","idx"),&Curve3D::remove_point);
  917. ObjectTypeDB::bind_method(_MD("clear_points"),&Curve3D::clear_points);
  918. ObjectTypeDB::bind_method(_MD("interpolate","idx","t"),&Curve3D::interpolate);
  919. ObjectTypeDB::bind_method(_MD("interpolatef","fofs"),&Curve3D::interpolatef);
  920. //ObjectTypeDB::bind_method(_MD("bake","subdivs"),&Curve3D::bake,DEFVAL(10));
  921. ObjectTypeDB::bind_method(_MD("set_bake_interval","distance"),&Curve3D::set_bake_interval);
  922. ObjectTypeDB::bind_method(_MD("get_bake_interval"),&Curve3D::get_bake_interval);
  923. ObjectTypeDB::bind_method(_MD("get_baked_length"),&Curve3D::get_baked_length);
  924. ObjectTypeDB::bind_method(_MD("interpolate_baked","offset","cubic"),&Curve3D::interpolate_baked,DEFVAL(false));
  925. ObjectTypeDB::bind_method(_MD("get_baked_points"),&Curve3D::get_baked_points);
  926. ObjectTypeDB::bind_method(_MD("get_baked_tilts"),&Curve3D::get_baked_tilts);
  927. ObjectTypeDB::bind_method(_MD("tesselate","max_stages","tolerance_degrees"),&Curve3D::tesselate,DEFVAL(5),DEFVAL(4));
  928. ObjectTypeDB::bind_method(_MD("_get_data"),&Curve3D::_get_data);
  929. ObjectTypeDB::bind_method(_MD("_set_data"),&Curve3D::_set_data);
  930. ADD_PROPERTY( PropertyInfo( Variant::REAL, "bake_interval",PROPERTY_HINT_RANGE,"0.01,512,0.01"), _SCS("set_bake_interval"),_SCS("get_bake_interval"));
  931. ADD_PROPERTY( PropertyInfo( Variant::INT, "_data",PROPERTY_HINT_NONE,"",PROPERTY_USAGE_NOEDITOR), _SCS("_set_data"),_SCS("_get_data"));
  932. /*ADD_PROPERTY( PropertyInfo( Variant::VECTOR3_ARRAY, "points_out"), _SCS("set_points_out"),_SCS("get_points_out"));
  933. ADD_PROPERTY( PropertyInfo( Variant::VECTOR3_ARRAY, "points_pos"), _SCS("set_points_pos"),_SCS("get_points_pos"));
  934. */
  935. }
  936. Curve3D::Curve3D()
  937. {
  938. baked_cache_dirty=false;
  939. baked_max_ofs=0;
  940. /* add_point(Vector3(-1,0,0));
  941. add_point(Vector3(0,2,0));
  942. add_point(Vector3(0,3,5));*/
  943. bake_interval=0.2;
  944. }