Optimal-Shortest-Path-in-Simple-Polygon
Let P be a simple polygon with n sides and this report will give a method to preprocess the polygon so that given two query points p and q inside P, the length of the shortest path inside the polygon from p to q can be found in time O(log n).
node-study
Intro of node
Neural-Networks
A note for the Coursera course "Advanced Learning Algorithms"