Editor's Note: This file was selected as MATLAB Central Pick of the Week
LineCurvature2D, This function calculates the curvature of a 2D line. It first fits polygons to the points. Then calculates the analytical curvature from the polygons.
K = LineCurvature2D(Vertices,Lines)
inputs,
Vertices : A M x 2 list of line points.
(optional)
Lines : A N x 2 list of line pieces, by indices of the vertices
(if not set assume Lines=[1 2; 3 4 ; ... ; M-1 M])
outputs,
K : M x 1 Curvature values
.
.
LineNormals2D, This function calculates the normals, of the line. Using the neighbouring points of each line/contour point, and forward an backward differences on the end points
N=LineNormals2D(V,L)
inputs,
V : List of points/vertices 2 x M
(optional)
Lines : A N x 2 list of line pieces, by indices of the vertices
(if not set assume Lines=[1 2; 3 4 ; ... ; M-1 M])
outputs,
N : The normals of the Vertices 2 x M
Dirk-Jan Kroon (2021). 2D Line Curvature and Normals (https://www.mathworks.com/matlabcentral/fileexchange/32696-2d-line-curvature-and-normals), MATLAB Central File Exchange. Retrieved .
Inspired: thick_line(x,y,thickness)
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Create scripts with code, output, and formatted text in a single executable document.
Does the algorithm work also for concave 2D surface? how can I recognize the points where the surface is convex and where it is concave?
Thank you
Dear all, the curvature is calculated simply by the formula in the following link, which is a result of planar differential geometry. https://math.stackexchange.com/questions/1250554/curvature-of-plane-parametric-curves
Dear Dirk,
Could you refer as to the math behind the last step of the calculation?Is there any literature? That is, how you get the curvature from the fitted polynomial?
bnscocozza@gmail.com
Dear Dirk-Jan Kroon,
thanks for this great function! Is there any chance for me to get the related papers explaining this method?
Thanks a lot!
1197349243@qq.com
It's a very nice code but I would like to know the mathematical foundation. Does anybody know it??
Hi . Can this code be used to break the curved line into small line segments of appropriate size with their ends overlapped to some small extent and then take hough transform?
can the code be used to find singular points in fingerprint? if yes how plz? thx. Ajit
From what i understand the algorithm only uses the direct neighbors of the point to be evaluated correct? is it possible to include multiple nearby points to get a more accurate result?
What is meant by lines?
very useful code. i would also like to know the mathematical model used. does it use the freeman chain code Dirk?
Thank you, good code to find in my case finger tips on a hand scan
Is there any literature to back this up??
Also, the grammar in the comments needs serious work....
Thank you! Very usefull code! I would like to understand the maths behind the code better. Is this code based on some literature?
I would like to point out a small typo:-
*****(correct)****
if(nargin<2)
L=[(1:(size(V,1)-1))' (2:size(V,1))'];
end
*****
In the code I saw,the above was :-
*****(typo)*****
Lines=[(1:(size(Vertices,1)-1))' (2:size(Vertices,1))'];
*****