|
Boost : |
Subject: [boost] [GSoC 2010] Sweepline algorithm
From: Marcin Fatyga (fatygamarcin_at_[hidden])
Date: 2010-03-27 04:15:26
Hello,
My name is Marcin Fatyga and I am doing double degree program in computer
science and mathematics on Warsaw University. I would like to participate in
GSoC 2010 - I would like to implement the sweepline algorithm and use it to
solve the problems related to it.
In my project I would like to implement the sweepline and then use Fortune's
Algorithm to solve the Voronoi Diagram's problem. Then I would provide some
modifications to solve the two remaining connected problems : Delanuay
triangulation and medial axis. All of these problems have many applications
in differnet fields of science and solving them could be useful to may
users.
Though I don't have quite much experience with the boost library itself, I
am particularly interested in algorithms and have some experience with both
C++ and generic programming.
Though there is no geometry library in current release, I can see it is in
development phase. Should the project be integrated with it/use it?
Best wishes
Marcin Fatyga
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk