Counting Circles Without Computing Them
Rudolf Fleischer · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2016
In this paper we engineer a fast algorithm to count the number of triangles defined by three lines out of a set of n lines whose circumcircle contains the origin. The trick is not to compute any triangles or circles.