Re: [boost] GSoC Generic Sweep Algorithm

Subject: Re: [boost] GSoC Generic Sweep Algorithm
From: Thomas Klimpel (Thomas.Klimpel_at_[hidden])
Date: 2010-03-31 05:14:27

Hi Sweta,

I am pleased to meet you. I guess Lucanus Simonson and other will happily help you to come up with a good proposal. I just want to comment on "plane sweep for 3 dimensions" and the "visibility problem".
 

Sweta Yamini wrote:
> And supplement it with inbuilt functions for line sweep, angular sweep
> about a point for 2 dimensions and plane sweep for 3 dimensions.

Neither Boost.Polygon nor Boost.Geometry currently have a good support for 3 dimensions. So it's better not to spend too much effort (or thoughts) on a plane sweep for 3 dimensions.

> Also, implement some algorithms like Voronoi diagrams, Delaunay triangulations,
> visibility problems using the generic sweep algorithm.

The visibility problem also exists in 2D. We acually have to solve it for certain applications. I have no idea how our implementation works, but I wasn't aware that it could be solved by a sweepline algorithm. So if you really want to implement a solution for the visibility problem, it would even make sense for the 2D case.

> I have looked through the documentation and could not find anything
> related to this.

Which documentation are you refering to? Do you mean <https://svn.boost.org/trac/boost/wiki/SoC2010> ? Or do you mean the documenation of Boost.Polygon or Boost.Geometry?

> Is there something I have missed? Also, could I contact anyone to
> discuss?

I don't think there is anything you have missed. We expect that you discuss it with us on this mailing list.

Regards,
Thomas