Loop¶
Overview¶
A directed set of half-edges determined by how the original shapes/subpaths were directionally. This is distinct from boundaries, as: 1. Input shapes/subpaths can self-intersect, ignore clockwise restrictions, and avoid boundary restrictions. 2. Input shapes/subpaths can repeat over the same edges multiple times (affecting winding order), and can even double-back or do other operations. 3. We need to record separate shape IDs for the different loops, so we can perform CAG operations on separate ones. This means we need to track winding order separately for each ID.
As operations simplify/remove/replace edges, it will handle replacement of the edges in the loops.
@author Jonathan Olson <jonathan.olson@colorado.edu>
Class Loop¶
Instance Methods¶
initialize( shapeId, closed )¶
Similar to a usual constructor, but is set up so it can be called multiple times (with dispose() in-between) to support pooling. @private
@param {number} shapeId @param {boolean} closed @returns {Loop} - This reference for chaining
serialize()¶
Returns an object form that can be turned back into a segment with the corresponding deserialize method. @public
@returns {Object}
toSubpath()¶
Returns a Subpath equivalent to this loop. @public
@returns {Subpath}
dispose()¶
Removes references (so it can allow other objects to be GC'ed or pooled), and frees itself to the pool so it can be reused. @public