Advanced Search

Question: Question on computational geometry

Question:Question on computational geometry

Markiyan Hirnyk 7759 Maple
September 17 2014
1

Let a finite set of closed intervals in the plane be given.
How to find all the intersections of these, outputing the intersection points together with the intersecting intervals?
This is a problem of computational geometry
(see http://en.wikipedia.org/wiki/Line_segment_intersection).
In other words, how to realize the sweep line algorithm in Maple?

PS. I'd like to note that computational geometry has serious applications, in particular, in robotics.
Please Wait...