On a triangle counting problem
Samir Khuller, Joseph S. B. Mitchell · Information Processing Letters · 1990
We consider the following problem: given a set S of n points in the plane, we would like to compute for each point pϵS, how many triangles with corners at points in set S contain p. We give an O(n2) algorithm to solve the problem.