# Does CGAL provide spherical polygons and spherical boolean operations?

4 messages
Open this post in threaded view
|

## Does CGAL provide spherical polygons and spherical boolean operations?

 Hello, I have a question about CGAL's support of spherical geometry. I need to project my 3D geometry onto a sphere (resulting in 2D spherical polygons) and then perform 2D boolean union and difference with these polygons. My questions are: - Does CGAL provide a spherical polygon representation? - Does CGAL provide boolean union/difference operations for these spherical polygons? - Could you provide a guess of how performant are spherical 2D boolean operations in comparison to planar 2D boolean operations? (for example, the time it takes to unite X spherical triangles vs. unite X planar triangles) Thank you tfmk -- Sent from: http://cgal-discuss.949826.n4.nabble.com/-- You are currently subscribed to cgal-discuss. To unsubscribe or access the archives, go to https://sympa.inria.fr/sympa/info/cgal-discuss
Open this post in threaded view
|

## Re: Does CGAL provide spherical polygons and spherical boolean operations?

 For now nothing is available for geometry on the sphere. In CGAL 5.1 there should be a triangulation package on the sphere that should be released and it will include constrained triangulations that could be used to compute Boolean operations of polygon on a sphere. The PR should be opened in the upcoming days/weeks so you could give it a try before the official integration if you want. Sebastien. On 10/20/19 1:45 AM, tfmk wrote: > Hello, I have a question about CGAL's support of spherical geometry. I need > to project my 3D geometry onto a sphere (resulting in 2D spherical polygons) > and then perform 2D boolean union and difference with these polygons. > > My questions are: > - Does CGAL provide a spherical polygon representation? > - Does CGAL provide boolean union/difference operations for these spherical > polygons? > - Could you provide a guess of how performant are spherical 2D boolean > operations in comparison to planar 2D boolean operations? (for example, the > time it takes to unite X spherical triangles vs. unite X planar triangles) > > Thank you > tfmk > > > > -- > Sent from: http://cgal-discuss.949826.n4.nabble.com/> -- You are currently subscribed to cgal-discuss. To unsubscribe or access the archives, go to https://sympa.inria.fr/sympa/info/cgal-discuss