scratchfoundation/paper.js
1
0
Fork 0
mirror of https://github.com/scratchfoundation/paper.js.git synced 2025-08-28 22:08:54 -04:00
Code Issues Projects Releases Packages Wiki Activity Actions

Introduce Curve.filterIntersections() and use it both in PathItems#getIntersections() and Curve#getIntersections()

Browse source
This commit is contained in:
Jürg Lehni 2015-01-02 21:00:05 +01:00
parent 3302a7dff5
commit b2261fd512
2 changed files with 52 additions and 49 deletions
Download patch file Download diff file Expand all files Collapse all files

53
src/path/Curve.js
View file

@ -308,8 +308,8 @@ var Curve = Base.extend(/** @lends Curve# */{
// DOCS: Curve#getIntersections() // DOCS: Curve#getIntersections()
getIntersections: function(curve) { getIntersections: function(curve) {
return Curve.getIntersections(this.getValues(), curve.getValues(), return Curve.filterIntersections(Curve.getIntersections(
this, curve, []); this.getValues(), curve.getValues(), this, curve, []));
}, },
// TODO: adjustThroughPoint // TODO: adjustThroughPoint
@ -1411,6 +1411,55 @@ new function() { // Scope for methods that require numerical integration
if (c1p2.isClose(c2p2, tolerance)) if (c1p2.isClose(c2p2, tolerance))
addLocation(locations, include, c1, 1, c1p2, c2, 1, c1p2); addLocation(locations, include, c1, 1, c1p2, c2, 1, c1p2);
return locations; return locations;
},
filterIntersections: function(locations, _expand) {
var max = locations.length - 1;
// Merge intersections very close to the end of a curve to the
// beginning of the next curve.
for (var i = max; i >= 0; i--) {
var loc = locations[i],
next = loc._curve.getNext(),
next2 = loc._curve2.getNext();
if (next && loc._parameter >= MAX) {
loc._parameter = 0;
loc._curve = next;
}
if (next2 && loc._parameter2 >= MAX) {
loc._parameter2 = 0;
loc._curve2 = next2;
}
}
// Compare helper to filter locations
function compare(loc1, loc2) {
var path1 = loc1.getPath(),
path2 = loc2.getPath();
return path1 === path2
// We can add parameter (0 <= t <= 1) to index
// (a integer) to compare both at the same time
? (loc1.getIndex() + loc1.getParameter())
- (loc2.getIndex() + loc2.getParameter())
// Sort by path id to group all locations on the same path.
: path1._id - path2._id;
}
if (max > 0) {
locations.sort(compare);
// Filter out duplicate locations
for (var i = max; i >= 1; i--) {
if (locations[i].equals(locations[i === 0 ? max : i - 1])) {
locations.splice(i, 1);
max--;
}
}
}
if (_expand) {
for (var i = max; i >= 0; i--)
locations.push(locations[i].getIntersection());
locations.sort(compare);
}
return locations;
} }
}}; }};
}); });

48
src/path/PathItem.js
View file

@ -132,53 +132,7 @@ var PathItem = Item.extend(/** @lends PathItem# */{
); );
} }
} }
// Now filter the locations and process _expand: return Curve.filterIntersections(locations, _expand);
var last = locations.length - 1;
// Merge intersections very close to the end of a curve to the beginning
// of the next curve.
for (var i = last; i >= 0; i--) {
var loc = locations[i],
next = loc._curve.getNext(),
next2 = loc._curve2.getNext();
if (next && loc._parameter >= MAX) {
loc._parameter = 0;
loc._curve = next;
}
if (next2 && loc._parameter2 >= MAX) {
loc._parameter2 = 0;
loc._curve2 = next2;
}
}
// Compare helper to filter locations
function compare(loc1, loc2) {
var path1 = loc1.getPath(),
path2 = loc2.getPath();
return path1 === path2
// We can add parameter (0 <= t <= 1) to index
// (a integer) to compare both at the same time
? (loc1.getIndex() + loc1.getParameter())
- (loc2.getIndex() + loc2.getParameter())
// Sort by path id to group all locations on the same path.
: path1._id - path2._id;
}
if (last > 0) {
locations.sort(compare);
// Filter out duplicate locations
for (var i = last; i >= 1; i--) {
if (locations[i].equals(locations[i === 0 ? last : i - 1])) {
locations.splice(i, 1);
last--;
}
}
}
if (_expand) {
for (var i = last; i >= 0; i--)
locations.push(locations[i].getIntersection());
locations.sort(compare);
}
return locations;
}, },
_asPathItem: function() { _asPathItem: function() {