static bool try_get_intersect_point_with_item_recursive(Geom::PathVector& conn_pv, SPItem* item,
const Geom::Affine& item_transform, double& intersect_pos) {
double initial_pos = intersect_pos;
// if this is a group...
if (SP_IS_GROUP(item)) {
SPGroup* group = SP_GROUP(item);
// consider all first-order children
double child_pos = 0.0;
std::vector<SPItem*> g = sp_item_group_item_list(group);
for (std::vector<SPItem*>::const_iterator i = g.begin();i!=g.end();i++) {
SPItem* child_item = *i;
try_get_intersect_point_with_item_recursive(conn_pv, child_item,
item_transform * child_item->transform, child_pos);
if (intersect_pos < child_pos)
intersect_pos = child_pos;
}
return intersect_pos != initial_pos;
}
// if this is not a shape, nothing to be done
if (!SP_IS_SHAPE(item)) return false;
// make sure it has an associated curve
SPCurve* item_curve = SP_SHAPE(item)->getCurve();
if (!item_curve) return false;
// apply transformations (up to common ancestor)
item_curve->transform(item_transform);
const Geom::PathVector& curve_pv = item_curve->get_pathvector();
Geom::CrossingSet cross = crossings(conn_pv, curve_pv);
// iterate over all Crossings
//TODO: check correctness of the following code: inner loop uses loop variable
// with a name identical to the loop variable of the outer loop. Then rename.
for (Geom::CrossingSet::const_iterator i = cross.begin(); i != cross.end(); ++i) {
const Geom::Crossings& cr = *i;
for (Geom::Crossings::const_iterator i = cr.begin(); i != cr.end(); ++i) {
const Geom::Crossing& cr_pt = *i;
if ( intersect_pos < cr_pt.ta)
intersect_pos = cr_pt.ta;
}
}
item_curve->unref();
return intersect_pos != initial_pos;
}
static bool try_get_intersect_point_with_item_recursive(Geom::PathVector& conn_pv, SPItem* item,
const Geom::Matrix& item_transform, double& intersect_pos) {
double initial_pos = intersect_pos;
// if this is a group...
if (SP_IS_GROUP(item)) {
SPGroup* group = SP_GROUP(item);
// consider all first-order children
double child_pos = 0.0;
for (GSList const* i = sp_item_group_item_list(group); i != NULL; i = i->next) {
SPItem* child_item = SP_ITEM(i->data);
try_get_intersect_point_with_item_recursive(conn_pv, child_item,
item_transform * child_item->transform, child_pos);
if (intersect_pos < child_pos)
intersect_pos = child_pos;
}
return intersect_pos != initial_pos;
}
// if this is not a shape, nothing to be done
if (!SP_IS_SHAPE(item)) return false;
// make sure it has an associated curve
SPCurve* item_curve = sp_shape_get_curve(SP_SHAPE(item));
if (!item_curve) return false;
// apply transformations (up to common ancestor)
item_curve->transform(item_transform);
const Geom::PathVector& curve_pv = item_curve->get_pathvector();
Geom::CrossingSet cross = crossings(conn_pv, curve_pv);
// iterate over all Crossings
for (Geom::CrossingSet::const_iterator i = cross.begin(); i != cross.end(); i++) {
const Geom::Crossings& cr = *i;
for (Geom::Crossings::const_iterator i = cr.begin(); i != cr.end(); i++) {
const Geom::Crossing& cr_pt = *i;
if ( intersect_pos < cr_pt.ta)
intersect_pos = cr_pt.ta;
}
}
item_curve->unref();
return intersect_pos != initial_pos;
}
void Inkscape::ObjectSnapper::_snapPathsConstrained(IntermSnapResults &isr,
SnapCandidatePoint const &p,
SnapConstraint const &c,
Geom::Point const &p_proj_on_constraint) const
{
_collectPaths(p_proj_on_constraint, p.getSourceType(), p.getSourceNum() <= 0);
// Now we can finally do the real snapping, using the paths collected above
SPDesktop const *dt = _snapmanager->getDesktop();
g_assert(dt != NULL);
Geom::Point direction_vector = c.getDirection();
if (!is_zero(direction_vector)) {
direction_vector = Geom::unit_vector(direction_vector);
}
// The intersection point of the constraint line with any path, must lie within two points on the
// SnapConstraint: p_min_on_cl and p_max_on_cl. The distance between those points is twice the snapping tolerance
Geom::Point const p_min_on_cl = dt->dt2doc(p_proj_on_constraint - getSnapperTolerance() * direction_vector);
Geom::Point const p_max_on_cl = dt->dt2doc(p_proj_on_constraint + getSnapperTolerance() * direction_vector);
Geom::Coord tolerance = getSnapperTolerance();
// PS: Because the paths we're about to snap to are all expressed relative to document coordinate system, we will have
// to convert the snapper coordinates from the desktop coordinates to document coordinates
std::vector<Geom::Path> constraint_path;
if (c.isCircular()) {
Geom::Circle constraint_circle(dt->dt2doc(c.getPoint()), c.getRadius());
constraint_circle.getPath(constraint_path);
} else {
Geom::Path constraint_line;
constraint_line.start(p_min_on_cl);
constraint_line.appendNew<Geom::LineSegment>(p_max_on_cl);
constraint_path.push_back(constraint_line);
}
// Length of constraint_path will always be one
bool strict_snapping = _snapmanager->snapprefs.getStrictSnapping();
// Find all intersections of the constrained path with the snap target candidates
std::vector<Geom::Point> intersections;
for (std::vector<SnapCandidatePath >::const_iterator k = _paths_to_snap_to->begin(); k != _paths_to_snap_to->end(); ++k) {
if (k->path_vector && _allowSourceToSnapToTarget(p.getSourceType(), (*k).target_type, strict_snapping)) {
// Do the intersection math
Geom::CrossingSet cs = Geom::crossings(constraint_path, *(k->path_vector));
// Store the results as intersection points
unsigned int index = 0;
for (Geom::CrossingSet::const_iterator i = cs.begin(); i != cs.end(); ++i) {
if (index >= constraint_path.size()) {
break;
}
// Reconstruct and store the points of intersection
for (Geom::Crossings::const_iterator m = (*i).begin(); m != (*i).end(); ++m) {
intersections.push_back(constraint_path[index].pointAt((*m).ta));
}
index++;
}
//Geom::crossings will not consider the closing segment apparently, so we'll handle that separately here
//TODO: This should have been fixed in rev. #9859, which makes this workaround obsolete
for(Geom::PathVector::iterator it_pv = k->path_vector->begin(); it_pv != k->path_vector->end(); ++it_pv) {
if (it_pv->closed()) {
// Get the closing linesegment and convert it to a path
Geom::Path cls;
cls.close(false);
cls.append(it_pv->back_closed());
// Intersect that closing path with the constrained path
Geom::Crossings cs = Geom::crossings(constraint_path.front(), cls);
// Reconstruct and store the points of intersection
index = 0; // assuming the constraint path vector has only one path
for (Geom::Crossings::const_iterator m = cs.begin(); m != cs.end(); ++m) {
intersections.push_back(constraint_path[index].pointAt((*m).ta));
}
}
}
// Convert the collected points of intersection to snapped points
for (std::vector<Geom::Point>::iterator p_inters = intersections.begin(); p_inters != intersections.end(); ++p_inters) {
// Convert to desktop coordinates
(*p_inters) = dt->doc2dt(*p_inters);
// Construct a snapped point
Geom::Coord dist = Geom::L2(p.getPoint() - *p_inters);
SnappedPoint s = SnappedPoint(*p_inters, p.getSourceType(), p.getSourceNum(), k->target_type, dist, getSnapperTolerance(), getSnapperAlwaysSnap(), true, k->target_bbox);;
// Store the snapped point
if (dist <= tolerance) { // If the intersection is within snapping range, then we might snap to it
isr.points.push_back(s);
}
}
}
}
}
