luke
/
klayout
mirror of https://github.com/KLayout/klayout.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Updated 2019 02 17 (markdown)

Matthias Köfferlein 2019-02-18 00:41:35 +01:00
parent 9ec67b3737
commit 780a8fca67
1 changed files with 4 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
2019-02-17.md

@ -50,3 +50,7 @@ When sending the output of hierarchical operations to a report database, the mar
Functions which require merged polygons utilize the net clustering algorithm to form the merged polygons. All connected shapes are collected and merged into a bigger polygon. This happens in the lowest possible level on the hierarchy where the shape clusters are complete. In some cases - when the shapes from big coherent regions - this may happen on the top cell level and the resulting polygon will be very big. This will lead to poor performance.
The XOR function is implemented as two NOT functions because of limitation of the underlying hierarchical processor. Hence XOR executes slower than AND or NOT. If both inputs of the XOR function originate from different layouts, hierarchy mapping has to happen to combine both contributions. This will consume even more time.
## Next Steps
The current implementation needs some polishing. The remaining functions need to be ported and tests for DRC scripts need to be written.