• Skip to main content
  • Skip to search
  • Skip to footer
Cadence Home
  • This search text may be transcribed, used, stored, or accessed by our third-party service providers per our Cookie Policy and Privacy Policy.

  1. Community Forums
  2. Custom IC SKILL
  3. How to create the biggest rectangle inside a Polygon

Stats

  • Locked Locked
  • Replies 1
  • Subscribers 143
  • Views 14767
  • Members are here 0
This discussion has been locked.
You can no longer post new replies to this discussion. If you have a question you can start a new discussion

How to create the biggest rectangle inside a Polygon

strotta
strotta over 5 years ago

Hello everyone!

I need a function where the input is a list of points that represent a polygon and the output is a list of 4 points that represent the biggest rectangle that fits inside the original polygon. Does anybody know an existing function for that?

Thanks

  • Cancel
Parents
  • Andrew Beckett
    Andrew Beckett over 5 years ago

    There's nothing built-in to do this. I was chatting about this with my team, and I'm not sure a general algorithm to find the largest rectangle within an arbitrary polygon is that easy. There may be multiple solutions for a start, and it could be that the points of the rectangle don't coincide with any points in the polygon. So the simple answer is I'm not aware of anything to do this, or even an algorithm to compute this. I did a quick google search too, and there are a number of papers and discussions on this - like this for example. Of course, if there are some specific constraints on this rectangle or on the polygon - then a simpler method may be possible. Either way, there's no built-in function for this AFAIK.

    Andrew. 

    • Cancel
    • Vote Up 0 Vote Down
    • Cancel
Reply
  • Andrew Beckett
    Andrew Beckett over 5 years ago

    There's nothing built-in to do this. I was chatting about this with my team, and I'm not sure a general algorithm to find the largest rectangle within an arbitrary polygon is that easy. There may be multiple solutions for a start, and it could be that the points of the rectangle don't coincide with any points in the polygon. So the simple answer is I'm not aware of anything to do this, or even an algorithm to compute this. I did a quick google search too, and there are a number of papers and discussions on this - like this for example. Of course, if there are some specific constraints on this rectangle or on the polygon - then a simpler method may be possible. Either way, there's no built-in function for this AFAIK.

    Andrew. 

    • Cancel
    • Vote Up 0 Vote Down
    • Cancel
Children
No Data

Community Guidelines

The Cadence Design Communities support Cadence users and technologists interacting to exchange ideas, news, technical information, and best practices to solve problems and get the most from Cadence technology. The community is open to everyone, and to provide the most value, we require participants to follow our Community Guidelines that facilitate a quality exchange of ideas and information. By accessing, contributing, using or downloading any materials from the site, you agree to be bound by the full Community Guidelines.

© 2025 Cadence Design Systems, Inc. All Rights Reserved.

  • Terms of Use
  • Privacy
  • Cookie Policy
  • US Trademarks
  • Do Not Sell or Share My Personal Information