• 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. get pcells within a polygonal area, hierarchically

Stats

  • Locked Locked
  • Replies 4
  • Subscribers 143
  • Views 13482
  • 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

get pcells within a polygonal area, hierarchically

caver456
caver456 over 7 years ago

We have a polygon (not rectangle) at the top level, and pcells within that polygon's area, at various levels of hierarchy.  We would like to read properties from all of those pcells.

A version of geSelectArea that would allow a start and stop level, instead of only selecting in the top level, would accomplish the goal.  dbGetOverlaps descends the hierarchy, and would work great if you could specify a non-rectangular search area.

Any ideas?

Thanks

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

    I don't think I could guess, because it is likely to be highly dependent upon the size of the region and how many tiles it would need, as well as the number of pcell instances you're likely to find. Even if I knew that I'm not sure I could guess which is likely to be the most efficient. Given the fact that you have abPointInPolygon, I don't think it's much code. Similarly fracturing the polygon (which could be done with dbLayerTile or the abe functions) won't be much code, nor would doing the reverse dbGetOverlaps.

    I suspect that in most cases any one would do and it wouldn't be worth re-implementing the other ways to find out unless there are a huge number of instances to check.

    Regards,

    Andrew

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

    I don't think I could guess, because it is likely to be highly dependent upon the size of the region and how many tiles it would need, as well as the number of pcell instances you're likely to find. Even if I knew that I'm not sure I could guess which is likely to be the most efficient. Given the fact that you have abPointInPolygon, I don't think it's much code. Similarly fracturing the polygon (which could be done with dbLayerTile or the abe functions) won't be much code, nor would doing the reverse dbGetOverlaps.

    I suspect that in most cases any one would do and it wouldn't be worth re-implementing the other ways to find out unless there are a huge number of instances to check.

    Regards,

    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