Re: [Update REQ 5169]: Sweep-line algorithms

[thornton at george.ee.washington.edu]

On Mon, 12 Dec 1994, Mark Phillips wrote:

> Ken,
>    I'm not aware of any working software for sweep-line
> segment-intersections here at the Geometry Center, but I've forwarded
> your message to Leonidas Palios (palios at geom.umn.edu) and David Dobkin
> (dpd at cs.princeton.edu); I believe that at least one of them has worked
> with such algorithms.
> 
> Mark Phillips
> Geometry Center
> 

Mark, over the weekend I discovered that
there is an implementation of the
Bentley-Ottmann line-intersection algorithm
implemented in the LEDA environment. 

It stands for "Library of Efficient
Data structures and Algorithms" and is
a C++ package developed in Germany.

That's about all I know about it. Have
you heard of it?

Ken
------------------------------------
Ken Thornton
Department of Electrical Engineering
University of Washington, FT-10
Seattle, WA 98195
thornton at ee.washington.edu

EEB lab    ((555) 555-5555
WTC lab    ((555) 555-5555
EEB office ((555) 555-5555
FAX        ((555) 555-5555
------------------------------------