diff options
author | Campbell Barton <ideasman42@gmail.com> | 2019-03-19 07:17:46 +0300 |
---|---|---|
committer | Campbell Barton <ideasman42@gmail.com> | 2019-03-19 07:17:46 +0300 |
commit | e7fd6c8f30cd1161496831859da403eaa34fdf89 (patch) | |
tree | 20d91289ea01da6e8cf668ae057e8aad7ff85887 /source/blender/bmesh | |
parent | 5ef4b0438cf4773e7dd8c661388bb2c3079869bf (diff) |
Cleanup: comment blocks
Diffstat (limited to 'source/blender/bmesh')
-rw-r--r-- | source/blender/bmesh/tools/bmesh_bevel.c | 32 |
1 files changed, 17 insertions, 15 deletions
diff --git a/source/blender/bmesh/tools/bmesh_bevel.c b/source/blender/bmesh/tools/bmesh_bevel.c index 798e357c308..f629c054f8c 100644 --- a/source/blender/bmesh/tools/bmesh_bevel.c +++ b/source/blender/bmesh/tools/bmesh_bevel.c @@ -5664,14 +5664,15 @@ static double find_superellipse_chord_endpoint(double x0, double dtarget, float return xnew; } - /* This search procedure to find equidistant points (x,y) in the first - * superellipse quadrant works for every superellipse exponent but is more - * expensive than known solutions for special cases. - * Call the point on superellipse that intersects x=y line mx. - * For r>=1 use only the range x in [0,mx] and mirror the rest along x=y line, - * for r<1 use only x in [mx,1]. Points are initially spaced and iteratively - * repositioned to have the same distance. */ - +/** + * This search procedure to find equidistant points (x,y) in the first + * superellipse quadrant works for every superellipse exponent but is more + * expensive than known solutions for special cases. + * Call the point on superellipse that intersects x=y line mx. + * For r>=1 use only the range x in [0,mx] and mirror the rest along x=y line, + * for r<1 use only x in [mx,1]. Points are initially spaced and iteratively + * repositioned to have the same distance. + */ static void find_even_superellipse_chords_general(int seg, float r, double *xvals, double *yvals) { const int smoothitermax = 10; @@ -5770,13 +5771,14 @@ static void find_even_superellipse_chords_general(int seg, float r, double *xval } } - /* Find equidistant points (x0,y0), (x1,y1)... (xn,yn) on the superellipse - * function in the first quadrant. For special profiles (linear, arc, - * rectangle) the point can be calculated easily, for any other profile a more - * expensive search procedure must be used because there is no known closed - * form for equidistant parametrization - * xvals and yvals should be size n+1 */ - +/** + * Find equidistant points (x0,y0), (x1,y1)... (xn,yn) on the superellipse + * function in the first quadrant. For special profiles (linear, arc, + * rectangle) the point can be calculated easily, for any other profile a more + * expensive search procedure must be used because there is no known closed + * form for equidistant parametrization + * xvals and yvals should be size n+1 + */ static void find_even_superellipse_chords(int n, float r, double *xvals, double *yvals) { int i, n2; |