curvedraw

annotate src/curve.cc @ 2:ce7aa9a0594c

improved curve editing
author John Tsiombikas <nuclear@member.fsf.org>
date Thu, 17 Dec 2015 05:13:25 +0200
parents 8e524989c904
children 2b7ae76c173f
rev   line source
nuclear@0 1 #include <float.h>
nuclear@0 2 #include "curve.h"
nuclear@0 3
nuclear@0 4 Curve::Curve(CurveType type)
nuclear@0 5 {
nuclear@0 6 this->type = type;
nuclear@0 7 }
nuclear@0 8
nuclear@0 9 void Curve::set_type(CurveType type)
nuclear@0 10 {
nuclear@0 11 this->type = type;
nuclear@0 12 }
nuclear@0 13
nuclear@0 14 CurveType Curve::get_type() const
nuclear@0 15 {
nuclear@0 16 return type;
nuclear@0 17 }
nuclear@0 18
nuclear@0 19 void Curve::add_point(const Vector2 &p, float weight)
nuclear@0 20 {
nuclear@0 21 cp.push_back(Vector3(p.x, p.y, weight));
nuclear@0 22 }
nuclear@0 23
nuclear@0 24 bool Curve::remove_point(int idx)
nuclear@0 25 {
nuclear@0 26 if(idx < 0 || idx >= (int)cp.size()) {
nuclear@0 27 return false;
nuclear@0 28 }
nuclear@0 29 cp.erase(cp.begin() + idx);
nuclear@0 30 return true;
nuclear@0 31 }
nuclear@0 32
nuclear@0 33 int Curve::nearest_point(const Vector2 &p)
nuclear@0 34 {
nuclear@0 35 int res = -1;
nuclear@0 36 float bestsq = FLT_MAX;
nuclear@0 37
nuclear@0 38 for(size_t i=0; i<cp.size(); i++) {
nuclear@0 39 float d = (get_point(i) - p).length_sq();
nuclear@0 40 if(d < bestsq) {
nuclear@0 41 bestsq = d;
nuclear@0 42 res = i;
nuclear@0 43 }
nuclear@0 44 }
nuclear@0 45
nuclear@0 46 return res;
nuclear@0 47 }
nuclear@0 48
nuclear@2 49 bool Curve::empty() const
nuclear@2 50 {
nuclear@2 51 return cp.empty();
nuclear@2 52 }
nuclear@2 53
nuclear@2 54 int Curve::size() const
nuclear@0 55 {
nuclear@0 56 return (int)cp.size();
nuclear@0 57 }
nuclear@0 58
nuclear@2 59 Vector3 &Curve::operator [](int idx)
nuclear@2 60 {
nuclear@2 61 return cp[idx];
nuclear@2 62 }
nuclear@2 63
nuclear@2 64 const Vector3 &Curve::operator [](int idx) const
nuclear@2 65 {
nuclear@2 66 return cp[idx];
nuclear@2 67 }
nuclear@2 68
nuclear@0 69 const Vector3 &Curve::get_homo_point(int idx) const
nuclear@0 70 {
nuclear@0 71 return cp[idx];
nuclear@0 72 }
nuclear@0 73
nuclear@0 74 Vector2 Curve::get_point(int idx) const
nuclear@0 75 {
nuclear@0 76 return Vector2(cp[idx].x, cp[idx].y);
nuclear@0 77 }
nuclear@0 78
nuclear@0 79 float Curve::get_weight(int idx) const
nuclear@0 80 {
nuclear@0 81 return cp[idx].z;
nuclear@0 82 }
nuclear@0 83
nuclear@0 84 bool Curve::set_point(int idx, const Vector2 &p, float weight)
nuclear@0 85 {
nuclear@0 86 if(idx < 0 || idx >= (int)cp.size()) {
nuclear@0 87 return false;
nuclear@0 88 }
nuclear@0 89 cp[idx] = Vector3(p.x, p.y, weight);
nuclear@0 90 return true;
nuclear@0 91 }
nuclear@0 92
nuclear@0 93 bool Curve::set_weight(int idx, float weight)
nuclear@0 94 {
nuclear@0 95 if(idx < 0 || idx >= (int)cp.size()) {
nuclear@0 96 return false;
nuclear@0 97 }
nuclear@0 98 cp[idx].z = weight;
nuclear@0 99 return true;
nuclear@0 100 }
nuclear@0 101
nuclear@2 102 bool Curve::move_point(int idx, const Vector2 &p)
nuclear@2 103 {
nuclear@2 104 if(idx < 0 || idx >= (int)cp.size()) {
nuclear@2 105 return false;
nuclear@2 106 }
nuclear@2 107 cp[idx] = Vector3(p.x, p.y, cp[idx].z);
nuclear@2 108 return true;
nuclear@2 109 }
nuclear@2 110
nuclear@0 111 Vector2 Curve::interpolate(float t, CurveType type) const
nuclear@0 112 {
nuclear@2 113 if(cp.empty()) {
nuclear@0 114 return Vector2(0, 0);
nuclear@0 115 }
nuclear@2 116
nuclear@2 117 int num_cp = (int)cp.size();
nuclear@0 118 if(num_cp == 1) {
nuclear@0 119 return Vector2(cp[0].x, cp[0].y);
nuclear@0 120 }
nuclear@0 121
nuclear@0 122 Vector3 res;
nuclear@2 123 int idx0 = std::min((int)floor(t * (num_cp - 1)), num_cp - 2);
nuclear@0 124 int idx1 = idx0 + 1;
nuclear@0 125
nuclear@0 126 float dt = 1.0 / (float)(num_cp - 1);
nuclear@0 127 float t0 = (float)idx0 * dt;
nuclear@0 128 float t1 = (float)idx1 * dt;
nuclear@0 129
nuclear@0 130 t = (t - t0) / (t1 - t0);
nuclear@0 131 if(t < 0.0) t = 0.0;
nuclear@0 132 if(t > 1.0) t = 1.0;
nuclear@0 133
nuclear@0 134 if(type == CURVE_LINEAR || num_cp <= 2) {
nuclear@0 135 res = lerp(cp[idx0], cp[idx1], t);
nuclear@0 136 } else {
nuclear@0 137 int idx_prev = idx0 <= 0 ? idx0 : idx0 - 1;
nuclear@0 138 int idx_next = idx1 >= num_cp - 1 ? idx1 : idx1 + 1;
nuclear@0 139
nuclear@0 140 if(type == CURVE_HERMITE) {
nuclear@0 141 res = catmull_rom_spline(cp[idx_prev], cp[idx0], cp[idx1], cp[idx_next], t);
nuclear@0 142 } else {
nuclear@0 143 res = bspline(cp[idx_prev], cp[idx0], cp[idx1], cp[idx_next], t);
nuclear@0 144 if(res.z != 0.0f) {
nuclear@0 145 res.x /= res.z;
nuclear@0 146 res.y /= res.z;
nuclear@0 147 }
nuclear@0 148 }
nuclear@0 149 }
nuclear@0 150
nuclear@0 151 return Vector2(res.x, res.y);
nuclear@0 152 }
nuclear@0 153
nuclear@0 154 Vector2 Curve::interpolate(float t) const
nuclear@0 155 {
nuclear@0 156 return interpolate(t, type);
nuclear@0 157 }
nuclear@0 158
nuclear@0 159 Vector2 Curve::operator ()(float t) const
nuclear@0 160 {
nuclear@0 161 return interpolate(t);
nuclear@0 162 }