CGAL users discussion list

[Mariette Yvinec <>]

CGAL offers 2D constrained and Delaunay constrained triangulations
that can be used to triangulate polygons.

Ralph Boland a écrit :

Hi

I am trying to convince some friends of mine who are looking for an
open source project to work on to implement a computational geometry
algorithm of mine and was considering doing so using CGal.
My algorithm is on polygons and I am wondering what algorithms on
polygons are already available.  When I looked at the documentation on
CGal  it seemed to me that some algorithms I hoped would already be
there are not.
  In particular, I was hoping CGAL would already have algorithms for:
   1) triangulating a polygon (or trapezoidization or both).
   2) Suri's algorithm for partitioning a polygon into weakly edge
visible polygons.
   3) Algorithms for computing shortest paths based on 2)
   4) Ray shooting in polygons.

None of these algorithms appear to be in CGal.  Is that correct?
Are there other open source projects that I could use that might have
implementations of these algorithms?
Are there other computational geometry packages that work in Java
or other languages  (C++ is not my favorite language)?

Thanks in advance for any information.

Ralph Boland