As Andrea says, a good offset curve generation algorithm would be nice.
Skeletonization is another area that would be useful directly and also as a
basis for other operations. You could look at either true skeletonization,
or the straight skeleton concept.
There's been interest in having a Constrained Delaunay Triangulation
algorithm (as opposed to the Conforming Delaunay algorithm which is
currently implemented). This could also provide Polygon Triangulation,
which is useful.
Another area of interest is computation on the spheroid (distance, area,
relationships, etc). Although this is more the field of geodetics rather
than pure computational geometry.
On Mon, Jun 24, 2013 at 7:09 AM, Sebastian Kürten <
[email protected]> wrote:
> Hello,
>
> I'm a student at FU Berlin and am looking for a topic for my master's
> thesis. I think it would be great to contribute something to an open
> source project. I've already used JTS a lot, like programming in Java
> and am generally interested in computational geometry.
>
> Do you know about any open problems in JTS or additional functionality
> that would be useful to complement it?
>
> Ideas welcome,
> Sebastian
>
>
> ------------------------------------------------------------------------------
> This SF.net email is sponsored by Windows:
>
> Build for Windows Store.
>
> http://p.sf.net/sfu/windows-dev2dev
> _______________________________________________
> Jts-topo-suite-user mailing list
> [email protected]
> https://lists.sourceforge.net/lists/listinfo/jts-topo-suite-user
>
------------------------------------------------------------------------------
This SF.net email is sponsored by Windows:
Build for Windows Store.
http://p.sf.net/sfu/windows-dev2dev
_______________________________________________
Jts-topo-suite-user mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/jts-topo-suite-user
