@Article{BLRVW84, author = { J[on] L. Bentley and C[harles] E. Leiserson and R[onald] L. Rivest and C. J. Van Wyk }, title = { Problem 84-2. Counting Chordal Intersections }, pages = { 592--594 }, doi = { 10.1016/0196-6774(84)90009-9 }, OPTurl = { http://www.sciencedirect.com/science/article/pii/0196677484900099 }, journal = { Journal of Algorithms }, issn = { 0196-6774 }, volume = { 5 }, number = { 4 }, OPTyear = { 1984 }, OPTmonth = { December }, date = { 1984-12 }, OPTnote = { (Problem is to efficiently count number of intersections of chords in a circle. In Problems column, edited by Leo J. Guibas; problem first stated in March '84 issue. ) }, }