Welcome to mirror list, hosted at ThFree Co, Russian Federation.

git.blender.org/blender.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
Diffstat (limited to 'source/blender/blenlib/BLI_convexhull_2d.h')
-rw-r--r--source/blender/blenlib/BLI_convexhull_2d.h4
1 files changed, 2 insertions, 2 deletions
diff --git a/source/blender/blenlib/BLI_convexhull_2d.h b/source/blender/blenlib/BLI_convexhull_2d.h
index 44758fb3880..77f3eedec95 100644
--- a/source/blender/blenlib/BLI_convexhull_2d.h
+++ b/source/blender/blenlib/BLI_convexhull_2d.h
@@ -32,7 +32,7 @@ extern "C" {
* \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[]);
+int BLI_convexhull_2d_sorted(const float (*points)[2], int n, int r_points[]);
/**
* A.M. Andrew's monotone chain 2D convex hull algorithm.
*
@@ -43,7 +43,7 @@ int BLI_convexhull_2d_sorted(const float (*points)[2], const int n, int r_points
* even though the final result will be no more than \a n in size.
* \returns the number of points in r_points.
*/
-int BLI_convexhull_2d(const float (*points)[2], const int n, int r_points[]);
+int BLI_convexhull_2d(const float (*points)[2], int n, int r_points[]);
/**
* \return The best angle for fitting the convex hull to an axis aligned bounding box.