Back to Results
First PageMeta Content
Convex hull / Algorithm / Bentley–Ottmann algorithm / Line segment intersection / Geometry / Computational geometry / Mathematics


Finding Intersections of Bichromatic Segments Defined by Points Amr Elmasry∗ Abstract Consider a set of n points in <2 , each colored either red or blue. A line segment defined by two red points is a
Add to Reading List

Document Date: 2008-10-28 21:24:09


Open Document

File Size: 88,31 KB

Share Result on Facebook
UPDATE