scratchfoundation/paper.js
1
0
Fork 0
mirror of https://github.com/scratchfoundation/paper.js.git synced 2025-01-20 22:39:50 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions

Union kinda working. Need to figureout the base path

Browse source
This commit is contained in:
hkrish 2013-05-01 02:27:28 +02:00
parent dbe07c9efc
commit 487219c26c
1 changed files with 71 additions and 23 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

56
Boolean2.js
View file

@ -125,12 +125,16 @@ function computeBoolean( _path1, _path2, operator ){
}
// step 1: discard invalid links according to the boolean operator
var lastNode, firstNode, nextNode, midPoint, insidePath1, insidePath2;
var thisId, thisWinding;
for (i = 0, len = paths.length; i < len; i++) {
path = paths[i];
var thisId = ( path.parent instanceof CompoundPath )? path.parent.id : path.id;
var thisWinding = path.clockwise;
var lastNode = path.lastSegment, firstNode = path.firstSegment;
var nextNode = null, midPoint, insidePath1, insidePath2;
thisId = ( path.parent instanceof CompoundPath )? path.parent.id : path.id;
thisWinding = path.clockwise;
lastNode = path.lastSegment;
firstNode = path.firstSegment;
nextNode = null;
console.log( thisId, path1Id, path2Id )
while( nextNode !== firstNode){
nextNode = ( nextNode )? nextNode.previous: lastNode;
crv = nextNode.curve;
@ -150,6 +154,49 @@ function computeBoolean( _path1, _path2, operator ){
}
}
}
// Final step: Retrieve the resulting paths from the graph
var boolResult = new CompoundPath();
boolResult.style = booleanStyle;
var node, nuNode, nuPath, nodeList = [], handle;
for (i = 0, len = paths.length; i < len; i++) {
nodeList = nodeList.concat( paths[i].segments );
}
for (i = 0, len = nodeList.length; i < len; i++) {
node = nodeList[i];
if( node.curve._INVALID || node._visited ){ continue; }
path = node.path;
thisId = ( path.parent instanceof CompoundPath )? path.parent.id : path.id;
thisWinding = path.clockwise;
nuPath = new Path();
// nuPath.selected = true;
firstNode = null;
while( node && !node._visited ){
node._visited = true;
firstNode = ( firstNode )? firstNode: node;
if( node._ixPair ) {
// node._ixPair is this node's intersection CurveLocation object
// node._ixPair._ixPair is the other CurveLocation object this node intersects with
nextNode = ( node.curve._INVALID )? node._ixPair._ixPair._segment : node;
nextNode._visited = true;
nuNode = new Segment( node.point, node.handleIn, nextNode.handleOut );
nuPath.add( nuNode );
node = nextNode;
path = node.path;
thisWinding = path.clockwise;
} else {
nuPath.add( node );
}
node = node.next;
view.draw();
}
nuPath.closed = true;
boolResult.addChild( nuPath );
}
window.pp = boolResult.reduce();
return boolResult.reduce();
}
function testOnCurve( path, point ){
@ -170,6 +217,7 @@ function testOnCurve( path, point ){
function unite( path1, path2 ){
var unionOp = function( isPath1, isInsidePath1, isInsidePath2 ){
this.type = 1;
return ( isInsidePath1 || isInsidePath2 )? false : true;
};
return computeBoolean( path1, path2, unionOp );