I just heard that Adam Sheffer has a blog called "The Plane Truth - Combinatorial geometry and other typos". Adam writes about algebraic techniques in combinatorial geometry. These techniques lead very recently to new results in the distinct distances problem (see here for the seminal paper by Guth and Katz).
Adam is known for his work on counting geometric graphs. In particular, he and Micha Sharir showed that every point set in the plane with n points contains at most triangulations. Since I am also working on similar problems I hope he also writes about these problems from time to time.