summary | shortlog | log | commit | commitdiff | tree
raw | patch | inline | side by side (parent: 3b97374)
raw | patch | inline | side by side (parent: 3b97374)
author | dvlierop2 <dvlierop2@users.sourceforge.net> | |
Thu, 21 May 2009 19:52:03 +0000 (19:52 +0000) | ||
committer | dvlierop2 <dvlierop2@users.sourceforge.net> | |
Thu, 21 May 2009 19:52:03 +0000 (19:52 +0000) |
src/removeoverlap/removeoverlap.cpp | patch | blob | history |
index 084f95dfea06b461c0848deaae4d51032b5ada34..975b4becb988e0ae7ec29412fa367e5630757bad 100644 (file)
if (item_box) {
Geom::Point min(item_box->min() - .5*gap);
Geom::Point max(item_box->max() + .5*gap);
+ // A negative gap is allowed, but will lead to problems when the gap is larger than
+ // the bounding box (in either X or Y direction, or both); min will have become max
+ // now, which cannot be handled by Rectangle() which is called below. And how will
+ // removeRectangleOverlap handle such a case?
+ // That's why we will enforce some boundaries on min and max here:
+ if (max[X] < min[X]) {
+ min[X] = max[X] = (min[X] + max[X])/2;
+ }
+ if (max[Y] < min[Y]) {
+ min[Y] = max[Y] = (min[Y] + max[Y])/2;
+ }
Rectangle *vspc_rect = new Rectangle(min[X], max[X], min[Y], max[Y]);
records.push_back(Record(*it, item_box->midpoint(), vspc_rect));
rs.push_back(vspc_rect);