Given a set of P feature points in the bidimensional plane, determine every line that contains at least N or more COLLINEAR points.
Use the package manager npm to install patter-recognition.
npm installRun the start script to launch the REST API server.
npm run startThe algorithm is not the fastest but I chosen to check the angle between each group of three points in the space to check the collinear condition:
This is to involved array operations mainly and brush up some algebra concepts from the middle School 😆
I added comments where needed and the core file is the maths.js one: from the points collection in the space, I take the bigger combination of them until I found the longest line segment or I reach the desired minimum number of collinear points.