On a triangle counting problem

TitleOn a triangle counting problem
Publication TypeJournal Articles
Year of Publication1990
AuthorsKhuller S, Mitchell JSB
JournalInformation Processing Letters
Volume33
Issue6
Pagination319 - 321
Date Published1990/02/10/
ISBN Number0020-0190
Keywordscombinatorics, computational geometry, Range query
Abstract

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.

URLhttp://www.sciencedirect.com/science/article/pii/002001909090217L
DOI10.1016/0020-0190(90)90217-L