Hi Martin and JTS Team Thanks for replying, quickly btw!
I’ve found a couple of them on Google, but they are mainly in C++ or as the one you sent me in javascript (I came up with this link as well). I couldn’t find any library in Java that I send a List of segment or Polygon or something and it returns the List of big rectangles or a only one rectangle that fits the polygon. Either way, thank you for your attention. Guilherme > On 18 Nov 2015, at 20:45, Martin Davis <[email protected]> wrote: > > No, JTS does not have a Largest Inscribed Rectangle function. It would be a > nice addition though. > > This algorithm might be a good starting point: > http://d3plus.org/blog/behind-the-scenes/2014/07/08/largest-rect/ > <http://d3plus.org/blog/behind-the-scenes/2014/07/08/largest-rect/> > > On Wed, Nov 18, 2015 at 6:18 AM, Guilherme Viteri <[email protected] > <mailto:[email protected]>> wrote: > Hi JTS Team, > > I am searching for a library that may save me tons of working hours. I have a > couple of polygons that overlap each other. I choose one, subtract all the > others that overlap and at the final I have a polygon. > Based on this final polygon I need to obtain the inscribed rectangle. > > I would like to know whether JTS has this feature already implemented. I am > searching in the documentation but I can’ t find anything related to, maybe > you guys have not used the same words I am looking for. > >
------------------------------------------------------------------------------
_______________________________________________ Jts-topo-suite-user mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/jts-topo-suite-user
