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

WIP: Optimizing performance of deep mode sized inside/outside

This commit is contained in:
Matthias Koefferlein 2024-06-25 00:30:20 +02:00
parent 8d630e723a
commit c3d3dd6239
1 changed files with 9 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
src/db/db/dbDeepRegion.cc
View File

@ -1824,9 +1824,10 @@ DeepRegion::sized_inside (const Region &inside, bool outside, coord_type dx, coo
db::Coord dx_chunk = dx, dy_chunk = dy;
int steps_chunk = steps;
// In outside mode, we perform at most max_steps in one chunk.
// This is supposed to limit the search range.
if (outside && steps > max_steps) {
// We perform at most max_steps in one chunk.
// This is supposed to limit the search range and merge shapes instead of creating
// heavily overlapping ones.
if (steps > max_steps) {
steps_chunk = max_steps;
dx_chunk = db::coord_traits<db::Coord>::rounded (dx * max_steps / double (steps));
dy_chunk = db::coord_traits<db::Coord>::rounded (dy * max_steps / double (steps));
@ -1852,11 +1853,15 @@ DeepRegion::sized_inside (const Region &inside, bool outside, coord_type dx, coo
proc.run (&op, prev.get () ? prev->deep_layer ().layer () : polygons.layer (), inside_polygons.layer (), res->deep_layer ().layer ());
// @@@ TODO: should we also merge in the last step and consider splitting?
// NOTE: in the last step we apply a polygon breaker in addition to "merge" so the
// result is granular for better deep mode performance
if (steps > 0) {
prev.reset (dynamic_cast<db::DeepRegion *> (res->merged ()));
tl_assert (prev.get () != 0);
res.reset (new db::DeepRegion (polygons.derived ()));
} else {
res.reset (dynamic_cast<db::DeepRegion *> (res->processed (db::PolygonBreaker (proc.max_vertex_count (), proc.area_ratio ()))));
tl_assert (res.get () != 0);
}
}