diff options
Diffstat (limited to 'source/blender/blenlib/intern/convexhull_2d.c')
| -rw-r--r-- | source/blender/blenlib/intern/convexhull_2d.c | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/source/blender/blenlib/intern/convexhull_2d.c b/source/blender/blenlib/intern/convexhull_2d.c index 38928dbbaa0..c4b408ba40f 100644 --- a/source/blender/blenlib/intern/convexhull_2d.c +++ b/source/blender/blenlib/intern/convexhull_2d.c @@ -60,9 +60,9 @@ static float is_left(const float p0[2], const float p1[2], const float p2[2]) /** * A.M. Andrew's monotone chain 2D convex hull algorithm * - * \param points An array of 2D points presorted by increasing x and y-coords. - * \param n The number of points in points. - * \param r_points An array of the convex hull vertex indices (max is n). + * \param points: An array of 2D points presorted by increasing x and y-coords. + * \param n: The number of points in points. + * \param r_points: An array of the convex hull vertex indices (max is n). * \returns the number of points in r_points. */ int BLI_convexhull_2d_sorted(const float (*points)[2], const int n, int r_points[]) @@ -184,9 +184,9 @@ static int pointref_cmp_yx(const void *a_, const void *b_) /** * A.M. Andrew's monotone chain 2D convex hull algorithm * - * \param points An array of 2D points. - * \param n The number of points in points. - * \param r_points An array of the convex hull vertex indices (max is n). + * \param points: An array of 2D points. + * \param n: The number of points in points. + * \param r_points: An array of the convex hull vertex indices (max is n). * _must_ be allocated as ``n * 2`` because of how its used internally, * even though the final result will be no more than \a n in size. * \returns the number of points in r_points. @@ -239,7 +239,7 @@ int BLI_convexhull_2d(const float (*points)[2], const int n, int r_points[]) * * Intended to be used with #BLI_convexhull_2d * - * \param points_hull Ordered hull points + * \param points_hull: Ordered hull points * (result of #BLI_convexhull_2d mapped to a contiguous array). * * \note we could return the index of the best edge too if its needed. @@ -294,7 +294,7 @@ float BLI_convexhull_aabb_fit_hull_2d(const float (*points_hull)[2], unsigned in /** * Wrap #BLI_convexhull_aabb_fit_hull_2d and do the convex hull calculation. * - * \param points arbitrary 2d points. + * \param points: arbitrary 2d points. */ float BLI_convexhull_aabb_fit_points_2d(const float (*points)[2], unsigned int n) { |