00001 /*===========================================================================*\ 00002 * * 00003 * OpenFlipper * 00004 * Copyright (C) 2001-2009 by Computer Graphics Group, RWTH Aachen * 00005 * www.openflipper.org * 00006 * * 00007 *---------------------------------------------------------------------------* 00008 * This file is part of OpenFlipper. * 00009 * * 00010 * OpenFlipper is free software: you can redistribute it and/or modify * 00011 * it under the terms of the GNU Lesser General Public License as * 00012 * published by the Free Software Foundation, either version 3 of * 00013 * the License, or (at your option) any later version with the * 00014 * following exceptions: * 00015 * * 00016 * If other files instantiate templates or use macros * 00017 * or inline functions from this file, or you compile this file and * 00018 * link it with other files to produce an executable, this file does * 00019 * not by itself cause the resulting executable to be covered by the * 00020 * GNU Lesser General Public License. This exception does not however * 00021 * invalidate any other reasons why the executable file might be * 00022 * covered by the GNU Lesser General Public License. * 00023 * * 00024 * OpenFlipper is distributed in the hope that it will be useful, * 00025 * but WITHOUT ANY WARRANTY; without even the implied warranty of * 00026 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * 00027 * GNU Lesser General Public License for more details. * 00028 * * 00029 * You should have received a copy of the GNU LesserGeneral Public * 00030 * License along with OpenFlipper. If not, * 00031 * see <http://www.gnu.org/licenses/>. * 00032 * * 00033 \*===========================================================================*/ 00034 00035 /*===========================================================================*\ 00036 * * 00037 * $Revision: 6743 $ * 00038 * $Author: moebius $ * 00039 * $Date: 2009-08-05 11:03:10 +0200 (Mi, 05. Aug 2009) $ * 00040 * * 00041 \*===========================================================================*/ 00042 00043 00044 00045 //============================================================================= 00046 // 00047 // CLASS BezierCurve - IMPLEMENTATION 00048 // 00049 //============================================================================= 00050 00051 #define ACG_BEZIERCURVE_C 00052 00053 //== INCLUDES ================================================================= 00054 00055 00056 #include "BezierCurveT.hh" 00057 00058 00059 //== IMPLEMENTATION ========================================================== 00060 00061 00062 namespace ACG { 00063 00064 00065 //----------------------------------------------------------------------------- 00066 00067 00068 template <class Point> 00069 Point 00070 BezierCurveT<Point>:: 00071 operator()(Scalar _t) const 00072 { 00073 // copy controll points 00074 std::vector<Point> b(*this); 00075 00076 unsigned int n = b.size()-1, k; 00077 Scalar t0(1.0-_t), t1(_t); 00078 00079 00080 // de Casteljau 00081 unsigned int i, j; 00082 for (i=0; i<n; ++i) 00083 for (j=0, k=n-i; j<k; ++j) 00084 b[j] = t0*b[j] + t1*b[j+1]; 00085 00086 00087 return b[0]; 00088 } 00089 00090 00091 //----------------------------------------------------------------------------- 00092 00093 00094 template <class Point> 00095 void 00096 BezierCurveT<Point>:: 00097 subdivide(Scalar _t, Self& _curve0, Self& _curve1) const 00098 { 00099 // copy controll points 00100 std::vector<Point> b(*this); 00101 00102 int n = degree(); 00103 Scalar t0(1.0-_t), t1(_t); 00104 00105 00106 _curve0.clear(); 00107 _curve0.reserve(n+1); 00108 _curve1.clear(); 00109 _curve1.reserve(n+1); 00110 00111 std::vector<Point> tmp; 00112 tmp.reserve(n+1); 00113 00114 00115 // de Casteljau 00116 int i, j, k; 00117 for (i=0; i<n; ++i) 00118 { 00119 _curve0.push_back(b[0]); 00120 tmp.push_back(b[n-i]); 00121 00122 for (j=0, k=n-i; j<k; ++j) 00123 b[j] = t0*b[j] + t1*b[j+1]; 00124 } 00125 00126 _curve0.push_back(b[0]); 00127 tmp.push_back(b[0]); 00128 00129 00130 for (i=n; i>=0; --i) 00131 _curve1.push_back(tmp[i]); 00132 00133 00134 assert(_curve0.degree() == n); 00135 assert(_curve1.degree() == n); 00136 } 00137 00138 00139 //============================================================================= 00140 } // namespace ACG 00141 //=============================================================================