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

Object snapping: now snapping to edge centers for polygons and boxes, snapping to box centers

This commit is contained in:
Matthias Koefferlein 2025-11-01 16:44:40 +01:00
parent 289facd5ee
commit ddc847ac1f
1 changed files with 25 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
src/laybasic/laybasic/laySnap.cc
View File

@ -613,7 +613,7 @@ private:
if (shape->is_polygon ()) { if (shape->is_polygon ()) {
for (db::Shape::polygon_edge_iterator e = shape->begin_edge (); ! e.at_end (); ++e) { for (db::Shape::polygon_edge_iterator e = shape->begin_edge (); ! e.at_end (); ++e) {
test_edge (t * *e); test_edge_with_center (t * *e);
} }
} else if (shape->is_path ()) { } else if (shape->is_path ()) {
@ -649,16 +649,20 @@ private:
} }
test_edge (db::DEdge (*p, pts [0])); test_edge (db::DEdge (*p, pts [0]));
} }
} else if (shape->is_box ()) { } else if (shape->is_box ()) {
const db::Box &box = shape->box (); const db::Box &box = shape->box ();
test_edge (t * db::Edge (box.p1 (), db::Point (box.left (), box.top ()))); test_edge_with_center (t * db::Edge (box.p1 (), db::Point (box.left (), box.top ())));
test_edge (t * db::Edge (db::Point (box.left (), box.top ()), box.p2 ())); test_edge_with_center (t * db::Edge (db::Point (box.left (), box.top ()), box.p2 ()));
test_edge (t * db::Edge (box.p2 (), db::Point (box.right (), box.bottom ()))); test_edge_with_center (t * db::Edge (box.p2 (), db::Point (box.right (), box.bottom ())));
test_edge (t * db::Edge (db::Point (box.right (), box.bottom ()), box.p1 ())); test_edge_with_center (t * db::Edge (db::Point (box.right (), box.bottom ()), box.p1 ()));
// test for box center
test_edge (t * db::Edge (box.center (), box.center ()));
} else if (shape->is_point ()) { } else if (shape->is_point ()) {
@ -697,6 +701,22 @@ private:
} }
void
test_edge_with_center (const db::DEdge &edg)
{
if (m_with_vertex && ! edg.is_degenerate ()) {
db::DPoint c = edg.p1 () + (edg.p2 () - edg.p1 ()) * 0.5;
if (m_region.contains (c)) {
closest (c);
}
}
test_edge (edg);
}
void void
test_edge (const db::DEdge &edg) test_edge (const db::DEdge &edg)
{ {