Revision as of 06:16, 25 July 2010 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,660 edits m authorlink goodrich ← Previous edit		Revision as of 21:05, 17 September 2010 edit undo Citation bot 1 (talk \| contribs) Bots 130,044 edits m Citations: [Pu186]Tweaked: unused_data. You can use this bot yourself. Report bugs here. Next edit →
Line 67: {{citation\|last=Clarkson\|first=K. L.\|authorlink=Kenneth L. Clarkson\|contribution=Applications of random sampling in computational geometry, II\|title=Proc. 4th ACM Symp. Computational Geometry\|pages=1–11\|year=1988\|doi=10.1145/73393.73394}}. {{citation\|last1=Clarkson\|first1=K. L.\|author1-link=Kenneth L. Clarkson\|last2=Cole\|first2=R.\|last3=Tarjan\|first3=R. E.\|author3-link=Robert Tarjan\|title=Randomized parallel algorithms for trapezoidal diagrams\|journal=[[International Journal of Computational Geometry and Applications]]\|volume=2\|issue=2\|year=1992\|pages=117–133\|doi=10.1142/S0218195992000081}}. Corrigendum, '''2''' (3): 341–343. {{citation\|unused_data=T.\|last1=Eppstein\|first1=D.\|author1-link=David Eppstein\|last2=Goodrich\|first2=M. \|author2-link=Michael T. Goodrich~~\|T.~~\|last3=Strash\|first3=D.\|contribution=Linear-time algorithms for geometric graphs with sublinearly many crossings\|title=Proc. 20th ACM-SIAM Symp. Discrete Algorithms (SODA 2009)\|id={{arxiv\|0812.0893}}\|year=2009\|pages=150–159}}. {{citation\|last=Mulmuley\|first=K.\|authorlink=Ketan Mulmuley\|contribution=A fast planar partition algorithm, I\|title=[[Symposium on Foundations of Computer Science\|Proc. 29th IEEE Symp. Foundations of Computer Science (FOCS 1988)]]\|year=1988\|pages=580–589\|doi=10.1109/SFCS.1988.21974}}. *{{citation\|last=O'Rourke\|first=J.\|authorlink= Joseph O'Rourke (professor)\|title=Computational Geometry in C\|edition=2nd\|publisher=Cambridge University Press\|year=1998\|isbn=9780521649766\|chapter=Section 7.7: Intersection of segments\|pages=263–265}}.

Bentley–Ottmann algorithm: Difference between revisions