Subject: Re: line crossings
i would look for some sweep line algorithm for line segments
intersections (arrangements of lines) - e.g.,
http://www.cs.wustl.edu/~pless/506/l4.html, i guess that the complexity
should be something like O(nlogn)
View All Messages in comp.graphics.algorithms
line crossings =>
Copyright © 2006 WatermarkFactory.com. All Rights Reserved.