CGAL users discussion list

Quoting "Alfredo Olivera" 
<>:

>  wrote:
> > Quoting "Alfredo Olivera" 
> > <>:
> >
> > > Hello.
> > >
> > > Given a Polygon representing the border of a region and a Polygon  
> > > representing a piece that must be placed inside the region, I need  
> > > to calculate the Inner Fit Polygon. This is, a polygon  
> > > representing all the possible positions of the piece that totally  
> > > overlap with the border.
> > >
> > > Is there a direct way to calculate the Inner Fit Polygon using the  
> > > minkowski_sum_2 procedure?

I think this is the only way you can do it. If you decompose it, you  
might as well decompose it already into convex pieces. The overall  
performance might be better.

> > One way to do it is to consider the complement of the polygon that  
> > represents the border, and decompose it into finite polygons that  
> > are accepted as summands of the Minkowski sum operation.
> That's how I do it today, but it requires 2 calls (in my case) to  
> the mink sum function. I wondered if there was a more efficient  
> way... because I calculate hundreds of such polygons.
> > > Thanks
> > >
> > > Alfredo
> > >
> > > --
> > > You are currently subscribed to cgal-discuss.
> > > To unsubscribe or access the archives, go to
> > > https://lists-sop.inria.fr/wws/info/cgal-discuss
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss