Revision as of 04:00, 27 May 2009 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,660 edits low memory is also a plus ← Previous edit		Revision as of 04:01, 27 May 2009 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,660 edits m →References: fix brown Next edit →
Line 59: {{citation\|last1=de Berg\|first1=Mark\|last2=van Kreveld\|first2=Marc\|last3=Overmars\|first3=Mark\|author3-link=Mark Overmars\|last4=Schwarzkopf\|first4=Otfried\|title=Computational Geometry\|publisher=Springer-Verlag\|year=2000\|isbn=9783540656203\|edition=2nd\|chapter=2 Line segment intersection\|pages=19–44}}. {{citation\|last1=Boissonat\|first1=J.-D.\|last2=Preparata\|first2=F. P.\|author2-link=Franco P. Preparata\|title=Robust plane sweep for intersecting segments\|journal=SIAM Journal on Computing\|year=2000\|url=http://www.cs.brown.edu/research/pubs/pdfs/2000/Boissonnat-2000-RPS.pdf\|doi=10.1137/S0097539797329373\|volume=29\|issue=5\|pages=1401–1421}}. {{citation\|last=Brown\|first=K. Q.\|title=Comments on “Algorithms for Reporting and Counting Geometric Intersections”\|journal=IEEE transactions on Computers\|year=~~1981volume~~1981\|volume=C-30\|issue=2\|page=147}}. {{citation\|last1=Chazelle\|first1=Bernard\|author1-link=Bernard Chazelle\|last2=Edelsbrunner\|first2=Herbert\|author2-link=Herbert Edelsbrunner\|title=An optimal algorithm for intersecting line segments in the plane\|journal=[[Journal of the ACM]]\|volume=39\|issue=1\|pages=1–54\|year=1992\|doi=10.1145/147508.147511}}. *{{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}}.

Bentley–Ottmann algorithm: Difference between revisions