1
0
Fork 0
freesewing/packages/core/src/path.js

896 lines
27 KiB
JavaScript
Raw Normal View History

2019-08-03 15:03:33 +02:00
import Attributes from './attributes'
import Point from './point'
import Bezier from 'bezier-js'
import {
linesIntersect,
lineIntersectsCurve,
curvesIntersect,
pointOnLine,
2018-08-31 09:44:12 +02:00
pointOnCurve,
curveEdge,
2018-08-31 09:44:12 +02:00
round
2019-08-03 15:03:33 +02:00
} from './utils'
2018-07-14 16:04:39 +00:00
function Path(debug = false) {
2019-08-03 15:03:33 +02:00
this.render = true
this.topLeft = false
this.bottomRight = false
this.attributes = new Attributes()
this.ops = []
Object.defineProperty(this, 'debug', { value: debug, configurable: true })
2018-07-23 20:14:32 +02:00
}
2018-07-14 16:04:39 +00:00
/** Adds the raise method for a path not created through the proxy **/
Path.prototype.withRaise = function (raise = false) {
2020-07-23 10:26:04 +02:00
if (raise) Object.defineProperty(this, 'raise', { value: raise })
return this
}
/** Chainable way to set the render property */
Path.prototype.setRender = function (render = true) {
2019-08-03 15:03:33 +02:00
if (render) this.render = true
else this.render = false
if (this.debug) this.raise.debug('Setting `Path.render` to ' + (render ? '`true`' : '`false`'))
2019-08-03 15:03:33 +02:00
return this
}
2018-07-23 20:14:32 +02:00
/** Adds a move operation to Point to */
Path.prototype.move = function (to) {
if (this.debug && to instanceof Point !== true)
this.raise.warning('Called `Path.rotate(to)` but `to` is not a `Point` object')
2019-08-03 15:03:33 +02:00
this.ops.push({ type: 'move', to })
2018-07-14 16:04:39 +00:00
2019-08-03 15:03:33 +02:00
return this
}
2018-07-14 16:04:39 +00:00
2018-07-23 20:14:32 +02:00
/** Adds a line operation to Point to */
Path.prototype.line = function (to) {
if (this.debug && to instanceof Point !== true)
this.raise.warning('Called `Path.line(to)` but `to` is not a `Point` object')
2019-08-03 15:03:33 +02:00
this.ops.push({ type: 'line', to })
2018-07-14 16:04:39 +00:00
2019-08-03 15:03:33 +02:00
return this
}
2018-07-14 16:04:39 +00:00
/** Adds a curve operation via cp1 & cp2 to Point to */
Path.prototype.curve = function (cp1, cp2, to) {
if (this.debug) {
if (to instanceof Point !== true)
this.raise.warning('Called `Path.curve(cp1, cp2, to)` but `to` is not a `Point` object')
if (cp1 instanceof Point !== true)
this.raise.warning('Called `Path.curve(cp1, cp2, to)` but `cp1` is not a `Point` object')
if (cp2 instanceof Point !== true)
this.raise.warning('Called `Path.curve(cp1, cp2, to)` but `cp2` is not a `Point` object')
}
2019-08-03 15:03:33 +02:00
this.ops.push({ type: 'curve', cp1, cp2, to })
2018-07-14 16:04:39 +00:00
2019-08-03 15:03:33 +02:00
return this
}
2018-07-14 16:04:39 +00:00
/** Adds a curve operation without cp1 via cp2 to Point to */
Path.prototype._curve = function (cp2, to) {
if (this.debug) {
if (to instanceof Point !== true)
this.raise.warning('Called `Path._curve(cp2, to)` but `to` is not a `Point` object')
if (cp2 instanceof Point !== true)
this.raise.warning('Called `Path._curve(cp2, to)` but `cp2` is not a `Point` object')
}
2019-08-03 15:03:33 +02:00
let cp1 = this.ops.slice(-1).pop().to
this.ops.push({ type: 'curve', cp1, cp2, to })
2019-08-03 15:03:33 +02:00
return this
}
/** Adds a curve operation via cp1 with no cp2 to Point to */
Path.prototype.curve_ = function (cp1, to) {
if (this.debug) {
if (to instanceof Point !== true)
this.raise.warning('Called `Path.curve_(cp1, to)` but `to` is not a `Point` object')
if (cp1 instanceof Point !== true)
this.raise.warning('Called `Path.curve_(cp1, to)` but `cp2` is not a `Point` object')
}
2019-08-03 15:03:33 +02:00
let cp2 = to.copy()
this.ops.push({ type: 'curve', cp1, cp2, to })
2019-08-03 15:03:33 +02:00
return this
}
2018-07-23 20:14:32 +02:00
/** Adds a close operation */
Path.prototype.close = function () {
2019-08-03 15:03:33 +02:00
this.ops.push({ type: 'close' })
2018-07-14 16:04:39 +00:00
2019-08-03 15:03:33 +02:00
return this
}
2018-07-14 16:04:39 +00:00
/** Adds a noop operation */
Path.prototype.noop = function (id = false) {
this.ops.push({ type: 'noop', id })
return this
}
/** Replace a noop operation with the ops from path */
Path.prototype.insop = function (noopId, path) {
if (this.debug) {
if (!noopId)
this.raise.warning('Called `Path.insop(noopId, path)` but `noopId` is undefined or false')
if (path instanceof Path !== true)
this.raise.warning('Called `Path.insop(noopId, path) but `path` is not a `Path` object')
}
let newPath = this.clone()
for (let i in newPath.ops) {
if (newPath.ops[i].type === 'noop' && newPath.ops[i].id === noopId) {
newPath.ops = newPath.ops
.slice(0, i)
.concat(path.ops)
.concat(newPath.ops.slice(Number(i) + 1))
}
}
return newPath
}
2018-07-23 20:14:32 +02:00
/** Adds an attribute. This is here to make this call chainable in assignment */
Path.prototype.attr = function (name, value, overwrite = false) {
if (this.debug) {
if (!name)
this.raise.warning(
'Called `Path.attr(name, value, overwrite=false)` but `name` is undefined or false'
)
if (typeof value === 'undefined')
this.raise.warning(
'Called `Path.attr(name, value, overwrite=false)` but `value` is undefined'
)
if (overwrite)
this.raise.debug(
`Overwriting \`Path.attribute.${name}\` with ${value} (was: ${this.attributes.get(name)})`
)
}
2019-08-03 15:03:33 +02:00
if (overwrite) this.attributes.set(name, value)
else this.attributes.add(name, value)
2019-08-03 15:03:33 +02:00
return this
}
2018-07-23 20:14:32 +02:00
/** Returns SVG pathstring for this path */
Path.prototype.asPathstring = function () {
2019-08-03 15:03:33 +02:00
let d = ''
2018-07-23 20:14:32 +02:00
for (let op of this.ops) {
switch (op.type) {
2019-08-03 15:03:33 +02:00
case 'move':
d += `M ${op.to.x},${op.to.y}`
break
case 'line':
d += ` L ${op.to.x},${op.to.y}`
break
case 'curve':
d += ` C ${op.cp1.x},${op.cp1.y} ${op.cp2.x},${op.cp2.y} ${op.to.x},${op.to.y}`
break
case 'close':
d += ' z'
break
2018-07-14 16:04:39 +00:00
}
2018-07-23 20:14:32 +02:00
}
2018-07-14 16:04:39 +00:00
2019-08-03 15:03:33 +02:00
return d
}
2018-07-23 11:12:06 +00:00
2018-07-26 13:43:12 +00:00
/** Returns offset of this path as a new path */
Path.prototype.offset = function (distance) {
if (typeof distance !== 'number')
this.raise.error('Called `Path.offset(distance)` but `distance` is not a number')
return pathOffset(this, distance, this.raise)
2019-08-03 15:03:33 +02:00
}
2018-07-26 13:43:12 +00:00
/** Returns the length of this path */
Path.prototype.length = function () {
2019-08-03 15:03:33 +02:00
let current, start
let length = 0
for (let i in this.ops) {
2019-08-03 15:03:33 +02:00
let op = this.ops[i]
if (op.type === 'move') {
start = op.to
} else if (op.type === 'line') {
length += current.dist(op.to)
} else if (op.type === 'curve') {
length += new Bezier(
{ x: current.x, y: current.y },
{ x: op.cp1.x, y: op.cp1.y },
{ x: op.cp2.x, y: op.cp2.y },
{ x: op.to.x, y: op.to.y }
2019-08-03 15:03:33 +02:00
).length()
} else if (op.type === 'close') {
length += current.dist(start)
}
2019-08-03 15:03:33 +02:00
if (op.to) current = op.to
}
2019-08-03 15:03:33 +02:00
return round(length)
}
/** Returns the startpoint of the path */
Path.prototype.start = function () {
if (this.ops.length < 1 || typeof this.ops[0].to === 'undefined')
this.raise.error('Called `Path.start()` but this path has no drawing operations')
2019-08-03 15:03:33 +02:00
return this.ops[0].to
}
/** Returns the endpoint of the path */
Path.prototype.end = function () {
if (this.ops.length < 1)
this.raise.error('Called `Path.end()` but this path has no drawing operations')
2019-08-03 15:03:33 +02:00
let op = this.ops[this.ops.length - 1]
2019-08-03 15:03:33 +02:00
if (op.type === 'close') return this.start()
else return op.to
}
2018-08-01 18:18:29 +02:00
/** Finds the bounding box of a path */
Path.prototype.boundary = function () {
2019-08-03 15:03:33 +02:00
if (this.topLeft) return this // Cached
2018-08-01 18:18:29 +02:00
2019-08-03 15:03:33 +02:00
let current
let topLeft = new Point(Infinity, Infinity)
let bottomRight = new Point(-Infinity, -Infinity)
let edges = []
2018-08-01 18:18:29 +02:00
for (let i in this.ops) {
2019-08-03 15:03:33 +02:00
let op = this.ops[i]
if (op.type === 'move' || op.type === 'line') {
2018-08-20 17:10:28 +02:00
if (op.to.x < topLeft.x) {
2019-08-03 15:03:33 +02:00
topLeft.x = op.to.x
edges['leftOp'] = i
2018-08-20 17:10:28 +02:00
}
if (op.to.y < topLeft.y) {
2019-08-03 15:03:33 +02:00
topLeft.y = op.to.y
edges['topOp'] = i
2018-08-20 17:10:28 +02:00
}
if (op.to.x > bottomRight.x) {
2019-08-03 15:03:33 +02:00
bottomRight.x = op.to.x
edges['rightOp'] = i
2018-08-20 17:10:28 +02:00
}
if (op.to.y > bottomRight.y) {
2019-08-03 15:03:33 +02:00
bottomRight.y = op.to.y
edges['bottomOp'] = i
2018-08-20 17:10:28 +02:00
}
2019-08-03 15:03:33 +02:00
} else if (op.type === 'curve') {
2018-08-01 18:18:29 +02:00
let bb = new Bezier(
{ x: current.x, y: current.y },
{ x: op.cp1.x, y: op.cp1.y },
{ x: op.cp2.x, y: op.cp2.y },
{ x: op.to.x, y: op.to.y }
2019-08-03 15:03:33 +02:00
).bbox()
2018-08-20 17:10:28 +02:00
if (bb.x.min < topLeft.x) {
2019-08-03 15:03:33 +02:00
topLeft.x = bb.x.min
edges['leftOp'] = i
2018-08-20 17:10:28 +02:00
}
if (bb.y.min < topLeft.y) {
2019-08-03 15:03:33 +02:00
topLeft.y = bb.y.min
edges['topOp'] = i
2018-08-20 17:10:28 +02:00
}
if (bb.x.max > bottomRight.x) {
2019-08-03 15:03:33 +02:00
bottomRight.x = bb.x.max
edges['rightOp'] = i
2018-08-20 17:10:28 +02:00
}
if (bb.y.max > bottomRight.y) {
2019-08-03 15:03:33 +02:00
bottomRight.y = bb.y.max
edges['bottomOp'] = i
2018-08-20 17:10:28 +02:00
}
2018-08-01 18:18:29 +02:00
}
2019-08-03 15:03:33 +02:00
if (op.to) current = op.to
2018-08-01 18:18:29 +02:00
}
2019-08-03 15:03:33 +02:00
this.topLeft = topLeft
this.bottomRight = bottomRight
2018-08-01 18:18:29 +02:00
2019-08-03 15:03:33 +02:00
for (let side of ['top', 'left', 'bottom', 'right']) {
let s = side + 'Op'
this[s] = this.ops[edges[s]]
this[s].from = this[s].type === 'move' ? this[s].to : this.ops[edges[s] - 1].to
2018-08-20 17:10:28 +02:00
}
2019-08-03 15:03:33 +02:00
return this
}
2018-08-03 14:20:28 +02:00
/** Returns a deep copy of this */
Path.prototype.clone = function () {
let clone = new Path(this.debug).withRaise(this.raise).setRender(this.render)
2019-08-03 15:03:33 +02:00
if (this.topLeft) clone.topLeft = this.topLeft.clone()
else clone.topLeft = false
if (this.bottomRight) clone.bottomRight = this.bottomRight.clone()
else clone.bottomRight = false
clone.attributes = this.attributes.clone()
clone.ops = []
2018-08-03 14:20:28 +02:00
for (let i in this.ops) {
2019-08-03 15:03:33 +02:00
let op = this.ops[i]
clone.ops[i] = { type: op.type }
if (op.type === 'move' || op.type === 'line') {
clone.ops[i].to = op.to.clone()
} else if (op.type === 'curve') {
clone.ops[i].to = op.to.clone()
clone.ops[i].cp1 = op.cp1.clone()
clone.ops[i].cp2 = op.cp2.clone()
} else if (op.type === 'noop') {
clone.ops[i].id = op.id
2018-08-03 14:20:28 +02:00
}
}
2019-08-03 15:03:33 +02:00
return clone
}
2018-08-03 14:20:28 +02:00
/** Joins this with that path, closes them if wanted */
Path.prototype.join = function (that, closed = false) {
if (that instanceof Path !== true)
this.raise.error('Called `Path.join(that)` but `that` is not a `Path` object')
return joinPaths([this, that], closed, this.raise)
2019-08-03 15:03:33 +02:00
}
/** Offsets a path by distance */
function pathOffset(path, distance, raise) {
2019-08-03 15:03:33 +02:00
let offset = []
let current
let start = false
let closed = false
for (let i in path.ops) {
2019-08-03 15:03:33 +02:00
let op = path.ops[i]
if (op.type === 'line') {
let segment = offsetLine(current, op.to, distance, path.debug, path.raise)
2019-08-03 15:03:33 +02:00
if (segment) offset.push(segment)
} else if (op.type === 'curve') {
// We need to avoid a control point sitting on top of start or end
// because that will break the offset in bezier-js
2019-08-03 15:03:33 +02:00
let cp1, cp2
if (current.sitsRoughlyOn(op.cp1)) {
cp1 = new Path(path.debug)
.withRaise(path.raise)
.move(current)
.curve(op.cp1, op.cp2, op.to)
.shiftAlong(2)
2019-08-03 15:03:33 +02:00
} else cp1 = op.cp1
if (op.cp2.sitsRoughlyOn(op.to)) {
cp2 = new Path(path.debug)
.withRaise(path.raise)
.move(op.to)
.curve(op.cp2, op.cp1, current)
.shiftAlong(2)
2019-08-03 15:03:33 +02:00
} else cp2 = op.cp2
let b = new Bezier(
{ x: current.x, y: current.y },
{ x: cp1.x, y: cp1.y },
{ x: cp2.x, y: cp2.y },
{ x: op.to.x, y: op.to.y }
2019-08-03 15:03:33 +02:00
)
for (let bezier of b.offset(distance)) offset.push(asPath(bezier, path.debug, path.raise))
2019-08-03 15:03:33 +02:00
} else if (op.type === 'close') closed = true
if (op.to) current = op.to
if (!start) start = current
}
return joinPaths(offset, closed, raise)
}
/** Offsets a line by distance */
function offsetLine(from, to, distance, debug = false, raise = false) {
2019-08-03 15:03:33 +02:00
if (from.x === to.x && from.y === to.y) return false
let angle = from.angle(to) - 90
return new Path(debug)
.withRaise(raise)
.move(from.shift(angle, distance))
.line(to.shift(angle, distance))
}
/** Converts a bezier-js instance to a path */
function asPath(bezier, debug = false, raise = false) {
return new Path(debug)
.withRaise(raise)
.move(new Point(bezier.points[0].x, bezier.points[0].y))
.curve(
new Point(bezier.points[1].x, bezier.points[1].y),
new Point(bezier.points[2].x, bezier.points[2].y),
new Point(bezier.points[3].x, bezier.points[3].y)
2019-08-03 15:03:33 +02:00
)
}
/** Joins path segments together into one path */
function joinPaths(paths, closed = false, raise = false) {
let joint = new Path(paths[0].debug).withRaise(paths[0].raise).move(paths[0].ops[0].to)
2019-08-03 15:03:33 +02:00
let current
for (let p of paths) {
for (let op of p.ops) {
2019-08-03 15:03:33 +02:00
if (op.type === 'curve') {
joint.curve(op.cp1, op.cp2, op.to)
} else if (op.type !== 'close') {
// We're using sitsRoughlyOn here to avoid miniscule line segments
2019-08-03 15:03:33 +02:00
if (current && !op.to.sitsRoughlyOn(current)) joint.line(op.to)
} else {
let err = 'Cannot join a closed path with another'
joint.raise.error(err)
throw new Error(err)
}
2019-08-03 15:03:33 +02:00
if (op.to) current = op.to
}
}
2019-08-03 15:03:33 +02:00
if (closed) joint.close()
2019-08-03 15:03:33 +02:00
return joint
}
/** Returns a point that lies at distance along this */
Path.prototype.shiftAlong = function (distance) {
if (typeof distance !== 'number')
this.raise.error('Called `Path.shiftAlong(distance)` but `distance` is not a number')
2019-08-03 15:03:33 +02:00
let len = 0
let current
for (let i in this.ops) {
2019-08-03 15:03:33 +02:00
let op = this.ops[i]
if (op.type === 'line') {
let thisLen = op.to.dist(current)
if (len + thisLen > distance) return current.shiftTowards(op.to, distance - len)
else len += thisLen
} else if (op.type === 'curve') {
let bezier = new Bezier(
{ x: current.x, y: current.y },
{ x: op.cp1.x, y: op.cp1.y },
{ x: op.cp2.x, y: op.cp2.y },
{ x: op.to.x, y: op.to.y }
2019-08-03 15:03:33 +02:00
)
let thisLen = bezier.length()
if (len + thisLen > distance) return shiftAlongBezier(distance - len, bezier)
else len += thisLen
}
2019-08-03 15:03:33 +02:00
current = op.to
}
this.raise.error(
`Called \`Path.shiftAlong(distance)\` with a \`distance\` of \`${distance}\` but \`Path.length()\` is only \`${this.length()}\``
2019-08-03 15:03:33 +02:00
)
}
/** Returns a point that lies at fraction along this */
Path.prototype.shiftFractionAlong = function (fraction) {
if (typeof fraction !== 'number')
this.raise.error('Called `Path.shiftFractionAlong(fraction)` but `fraction` is not a number')
2019-08-03 15:03:33 +02:00
return this.shiftAlong(this.length() * fraction)
}
/** Returns a point that lies at distance along bezier */
function shiftAlongBezier(distance, bezier) {
2019-08-03 15:03:33 +02:00
let steps = 100
let previous, next, t, thisLen
let len = 0
for (let i = 0; i <= steps; i++) {
2019-08-03 15:03:33 +02:00
t = i / steps
next = bezier.get(t)
next = new Point(next.x, next.y)
if (i > 0) {
2019-08-03 15:03:33 +02:00
thisLen = next.dist(previous)
if (len + thisLen > distance) return next
else len += thisLen
}
2019-08-03 15:03:33 +02:00
previous = next
}
}
2018-08-08 15:53:07 +02:00
/** Returns a point at the top edge of a bounding box of this */
Path.prototype.bbox = function () {
2019-08-03 15:03:33 +02:00
let bbs = []
let current
2018-08-08 15:53:07 +02:00
for (let i in this.ops) {
2019-08-03 15:03:33 +02:00
let op = this.ops[i]
if (op.type === 'line') {
bbs.push(lineBoundingBox({ from: current, to: op.to }))
} else if (op.type === 'curve') {
2018-08-08 15:53:07 +02:00
bbs.push(
curveBoundingBox(
new Bezier(
{ x: current.x, y: current.y },
{ x: op.cp1.x, y: op.cp1.y },
{ x: op.cp2.x, y: op.cp2.y },
{ x: op.to.x, y: op.to.y }
)
)
2019-08-03 15:03:33 +02:00
)
2018-08-08 15:53:07 +02:00
}
2019-08-03 15:03:33 +02:00
if (op.to) current = op.to
2018-08-08 15:53:07 +02:00
}
2019-08-03 15:03:33 +02:00
return bbbbox(bbs)
}
2018-08-08 15:53:07 +02:00
function lineBoundingBox(line) {
2019-08-03 15:03:33 +02:00
let from = line.from
let to = line.to
2018-08-08 15:53:07 +02:00
if (from.x === to.x) {
2019-08-03 15:03:33 +02:00
if (from.y < to.y) return { topLeft: from, bottomRight: to }
else return { topLeft: to, bottomRight: from }
2018-08-08 15:53:07 +02:00
} else if (from.y === to.y) {
2019-08-03 15:03:33 +02:00
if (from.x < to.x) return { topLeft: from, bottomRight: to }
else return { topLeft: to, bottomRight: from }
2018-08-08 15:53:07 +02:00
} else if (from.x < to.x) {
2019-08-03 15:03:33 +02:00
if (from.y < to.y) return { topLeft: from, bottomRight: to }
2018-08-08 15:53:07 +02:00
else
return {
topLeft: new Point(from.x, to.y),
bottomRight: new Point(to.x, from.y)
2019-08-03 15:03:33 +02:00
}
2018-08-08 15:53:07 +02:00
} else if (from.x > to.x) {
2018-08-13 08:02:55 +02:00
if (from.y < to.y)
2018-08-08 15:53:07 +02:00
return {
topLeft: new Point(to.x, from.y),
bottomRight: new Point(from.x, to.y)
2019-08-03 15:03:33 +02:00
}
2018-08-13 08:02:55 +02:00
else
return {
topLeft: new Point(to.x, to.y),
bottomRight: new Point(from.x, from.y)
2019-08-03 15:03:33 +02:00
}
2018-08-08 15:53:07 +02:00
}
}
function curveBoundingBox(curve) {
2019-08-03 15:03:33 +02:00
let bb = curve.bbox()
2018-08-08 15:53:07 +02:00
return {
topLeft: new Point(bb.x.min, bb.y.min),
bottomRight: new Point(bb.x.max, bb.y.max)
2019-08-03 15:03:33 +02:00
}
2018-08-08 15:53:07 +02:00
}
function bbbbox(boxes) {
2019-08-03 15:03:33 +02:00
let minX = Infinity
let maxX = -Infinity
let minY = Infinity
let maxY = -Infinity
2018-08-08 15:53:07 +02:00
for (let box of boxes) {
2019-08-03 15:03:33 +02:00
if (box.topLeft.x < minX) minX = box.topLeft.x
if (box.topLeft.y < minY) minY = box.topLeft.y
if (box.bottomRight.x > maxX) maxX = box.bottomRight.x
if (box.bottomRight.y > maxY) maxY = box.bottomRight.y
2018-08-08 15:53:07 +02:00
}
2019-08-03 15:03:33 +02:00
return { topLeft: new Point(minX, minY), bottomRight: new Point(maxX, maxY) }
2018-08-08 15:53:07 +02:00
}
2018-08-09 10:46:14 +02:00
/** Returns a reversed version of this */
Path.prototype.reverse = function () {
2019-08-03 15:03:33 +02:00
let sections = []
let current
let closed = false
2018-08-09 10:46:14 +02:00
for (let i in this.ops) {
2019-08-03 15:03:33 +02:00
let op = this.ops[i]
if (op.type === 'line') {
if (!op.to.sitsOn(current))
sections.push(new Path(this.debug).withRaise(this.raise).move(op.to).line(current))
2019-08-03 15:03:33 +02:00
} else if (op.type === 'curve') {
sections.push(
new Path(this.debug).withRaise(this.raise).move(op.to).curve(op.cp2, op.cp1, current)
)
2019-08-03 15:03:33 +02:00
} else if (op.type === 'close') {
closed = true
2018-08-09 10:46:14 +02:00
}
2019-08-03 15:03:33 +02:00
if (op.to) current = op.to
2018-08-09 10:46:14 +02:00
}
let rev = new Path(this.debug).withRaise(this.raise).move(current)
2019-08-03 15:03:33 +02:00
for (let section of sections.reverse()) rev.ops.push(section.ops[1])
if (closed) rev.close()
2018-08-09 10:46:14 +02:00
2019-08-03 15:03:33 +02:00
return rev
}
2018-08-09 10:46:14 +02:00
/** Returns the point at an edge of this path */
Path.prototype.edge = function (side) {
2019-08-03 15:03:33 +02:00
this.boundary()
if (side === 'topLeft') return this.topLeft
else if (side === 'bottomRight') return this.bottomRight
else if (side === 'topRight') return new Point(this.bottomRight.x, this.topLeft.y)
else if (side === 'bottomLeft') return new Point(this.topLeft.x, this.bottomRight.y)
2018-08-20 17:10:28 +02:00
else {
2019-08-03 15:03:33 +02:00
let s = side + 'Op'
if (this[s].type === 'move') return this[s].to
else if (this[s].type === 'line') {
if (side === 'top') {
if (this.topOp.to.y < this.topOp.from.y) return this.topOp.to
else return this.topOp.from
} else if (side === 'left') {
if (this.leftOp.to.x < this.leftOp.from.x) return this.leftOp.to
else return this.leftOp.from
} else if (side === 'bottom') {
if (this.bottomOp.to.y > this.bottomOp.from.y) return this.bottomOp.to
else return this.bottomOp.from
} else if (side === 'right') {
if (this.rightOp.to.x > this.rightOp.from.x) return this.rightOp.to
else return this.rightOp.from
2018-08-20 17:10:28 +02:00
}
2019-08-03 15:03:33 +02:00
} else if (this[s].type === 'curve') {
let curve = edgeCurveAsBezier(this[s])
return curveEdge(curve, side)
2018-08-20 17:10:28 +02:00
}
}
this.raise.error(`Unable to find \`Path.edge(side)\` for side ${side}`)
2019-08-03 15:03:33 +02:00
}
2018-08-20 17:10:28 +02:00
function edgeCurveAsBezier(op) {
return new Bezier(
{ x: op.from.x, y: op.from.y },
{ x: op.cp1.x, y: op.cp1.y },
{ x: op.cp2.x, y: op.cp2.y },
{ x: op.to.x, y: op.to.y }
2019-08-03 15:03:33 +02:00
)
2018-08-20 17:10:28 +02:00
}
/** Divides a path into atomic paths */
Path.prototype.divide = function () {
2019-08-03 15:03:33 +02:00
let paths = []
let current, start
for (let i in this.ops) {
2019-08-03 15:03:33 +02:00
let op = this.ops[i]
if (op.type === 'move') {
start = op.to
} else if (op.type === 'line') {
if (!op.to.sitsRoughlyOn(current))
paths.push(new Path(this.debug).withRaise(this.raise).move(current).line(op.to))
2019-08-03 15:03:33 +02:00
} else if (op.type === 'curve') {
paths.push(
new Path(this.debug).withRaise(this.raise).move(current).curve(op.cp1, op.cp2, op.to)
)
2019-08-03 15:03:33 +02:00
} else if (op.type === 'close') {
paths.push(new Path(this.debug).withRaise(this.raise).move(current).line(start))
}
2019-08-03 15:03:33 +02:00
if (op.to) current = op.to
}
2019-08-03 15:03:33 +02:00
return paths
}
/** Finds intersections between this path and an X value */
Path.prototype.intersectsX = function (x) {
if (typeof x !== 'number')
this.raise.error('Called `Path.intersectsX(x)` but `x` is not a number')
2019-08-03 15:03:33 +02:00
return this.intersectsAxis(x, 'x')
}
/** Finds intersections between this path and an Y value */
Path.prototype.intersectsY = function (y) {
if (typeof y !== 'number')
this.raise.error('Called `Path.intersectsX(y)` but `y` is not a number')
2019-08-03 15:03:33 +02:00
return this.intersectsAxis(y, 'y')
}
/** Finds intersections between this path and a X or Y value */
Path.prototype.intersectsAxis = function (val = false, mode) {
2019-08-03 15:03:33 +02:00
let intersections = []
let lineStart = mode === 'x' ? new Point(val, -100000) : new Point(-10000, val)
let lineEnd = mode === 'x' ? new Point(val, 100000) : new Point(100000, val)
for (let path of this.divide()) {
2019-08-03 15:03:33 +02:00
if (path.ops[1].type === 'line') {
addIntersectionsToArray(
linesIntersect(path.ops[0].to, path.ops[1].to, lineStart, lineEnd),
intersections
2019-08-03 15:03:33 +02:00
)
} else if (path.ops[1].type === 'curve') {
addIntersectionsToArray(
lineIntersectsCurve(
lineStart,
lineEnd,
path.ops[0].to,
path.ops[1].cp1,
path.ops[1].cp2,
path.ops[1].to
),
intersections
2019-08-03 15:03:33 +02:00
)
}
}
2019-08-03 15:03:33 +02:00
return intersections
}
/** Finds intersections between this path and another path */
Path.prototype.intersects = function (path) {
if (this === path)
this.raise.error('You called Path.intersects(path)` but `path` and `this` are the same object')
2019-08-03 15:03:33 +02:00
let intersections = []
for (let pathA of this.divide()) {
for (let pathB of path.divide()) {
2019-08-03 15:03:33 +02:00
if (pathA.ops[1].type === 'line') {
if (pathB.ops[1].type === 'line') {
addIntersectionsToArray(
2019-08-03 15:03:33 +02:00
linesIntersect(pathA.ops[0].to, pathA.ops[1].to, pathB.ops[0].to, pathB.ops[1].to),
intersections
2019-08-03 15:03:33 +02:00
)
} else if (pathB.ops[1].type === 'curve') {
addIntersectionsToArray(
lineIntersectsCurve(
pathA.ops[0].to,
pathA.ops[1].to,
pathB.ops[0].to,
pathB.ops[1].cp1,
pathB.ops[1].cp2,
pathB.ops[1].to
),
intersections
2019-08-03 15:03:33 +02:00
)
}
2019-08-03 15:03:33 +02:00
} else if (pathA.ops[1].type === 'curve') {
if (pathB.ops[1].type === 'line') {
addIntersectionsToArray(
lineIntersectsCurve(
pathB.ops[0].to,
pathB.ops[1].to,
pathA.ops[0].to,
pathA.ops[1].cp1,
pathA.ops[1].cp2,
pathA.ops[1].to
),
intersections
2019-08-03 15:03:33 +02:00
)
} else if (pathB.ops[1].type === 'curve') {
addIntersectionsToArray(
curvesIntersect(
pathA.ops[0].to,
pathA.ops[1].cp1,
pathA.ops[1].cp2,
pathA.ops[1].to,
pathB.ops[0].to,
pathB.ops[1].cp1,
pathB.ops[1].cp2,
pathB.ops[1].to
),
intersections
2019-08-03 15:03:33 +02:00
)
}
}
}
}
2019-08-03 15:03:33 +02:00
return intersections
}
function addIntersectionsToArray(candidates, intersections) {
2019-08-03 15:03:33 +02:00
if (!candidates) return
if (typeof candidates === 'object') {
if (typeof candidates.x === 'number') intersections.push(candidates)
else {
2019-08-03 15:03:33 +02:00
for (let candidate of candidates) intersections.push(candidate)
}
}
}
2018-08-20 17:10:28 +02:00
/** Splits path on point, and retuns both halves */
Path.prototype.split = function (point) {
if (point instanceof Point !== true)
this.raise.error('Called `Path.split(point)` but `point` is not a `Point` object')
2019-08-03 15:03:33 +02:00
let divided = this.divide()
let firstHalf = false
let secondHalf = false
for (let pi = 0; pi < divided.length; pi++) {
2019-08-03 15:03:33 +02:00
let path = divided[pi]
if (path.ops[1].type === 'line') {
if (pointOnLine(path.ops[0].to, path.ops[1].to, point)) {
2019-08-03 15:03:33 +02:00
firstHalf = divided.slice(0, pi)
firstHalf.push(new Path(this.debug).withRaise(this.raise).move(path.ops[0].to).line(point))
2019-08-03 15:03:33 +02:00
pi++
secondHalf = divided.slice(pi)
secondHalf.unshift(
new Path(this.debug).withRaise(this.raise).move(point).line(path.ops[1].to)
)
}
2019-08-03 15:03:33 +02:00
} else if (path.ops[1].type === 'curve') {
let t = pointOnCurve(path.ops[0].to, path.ops[1].cp1, path.ops[1].cp2, path.ops[1].to, point)
if (t !== false) {
let curve = new Bezier(
{ x: path.ops[0].to.x, y: path.ops[0].to.y },
{ x: path.ops[1].cp1.x, y: path.ops[1].cp1.y },
{ x: path.ops[1].cp2.x, y: path.ops[1].cp2.y },
{ x: path.ops[1].to.x, y: path.ops[1].to.y }
2019-08-03 15:03:33 +02:00
)
let split = curve.split(t)
firstHalf = divided.slice(0, pi)
firstHalf.push(
new Path(this.debug)
.withRaise(this.raise)
.move(new Point(split.left.points[0].x, split.left.points[0].y))
.curve(
new Point(split.left.points[1].x, split.left.points[1].y),
new Point(split.left.points[2].x, split.left.points[2].y),
new Point(split.left.points[3].x, split.left.points[3].y)
)
2019-08-03 15:03:33 +02:00
)
pi++
secondHalf = divided.slice(pi)
secondHalf.unshift(
new Path(this.debug)
.withRaise(this.raise)
.move(new Point(split.right.points[0].x, split.right.points[0].y))
.curve(
new Point(split.right.points[1].x, split.right.points[1].y),
new Point(split.right.points[2].x, split.right.points[2].y),
new Point(split.right.points[3].x, split.right.points[3].y)
)
2019-08-03 15:03:33 +02:00
)
}
}
}
if (firstHalf) firstHalf = joinPaths(firstHalf, false, this.raise)
if (secondHalf) secondHalf = joinPaths(secondHalf, false, this.raise)
2019-08-03 15:03:33 +02:00
return [firstHalf, secondHalf]
}
2018-09-04 14:26:45 +02:00
/** Removes self-intersections (overlap) from the path */
Path.prototype.trim = function () {
2019-08-03 15:03:33 +02:00
let chunks = this.divide()
for (let i = 0; i < chunks.length; i++) {
2019-08-03 15:03:33 +02:00
let firstCandidate = parseInt(i) + 2
let lastCandidate = parseInt(chunks.length) - 1
2018-09-04 14:26:45 +02:00
for (let j = firstCandidate; j < lastCandidate; j++) {
2019-08-03 15:03:33 +02:00
let intersections = chunks[i].intersects(chunks[j])
2018-09-04 14:26:45 +02:00
if (intersections.length > 0) {
2019-08-03 15:03:33 +02:00
let intersection = intersections.pop()
let trimmedStart = chunks.slice(0, i)
let trimmedEnd = chunks.slice(parseInt(j) + 1)
let glue = new Path(this.debug).withRaise(this.raise)
2019-08-03 15:03:33 +02:00
let first = true
2018-09-04 15:21:59 +02:00
for (let k of [i, j]) {
2019-08-03 15:03:33 +02:00
let ops = chunks[k].ops
if (ops[1].type === 'line') {
glue.line(intersection)
} else if (ops[1].type === 'curve') {
2018-09-04 15:21:59 +02:00
// handle curve
let curve = new Bezier(
{ x: ops[0].to.x, y: ops[0].to.y },
{ x: ops[1].cp1.x, y: ops[1].cp1.y },
{ x: ops[1].cp2.x, y: ops[1].cp2.y },
{ x: ops[1].to.x, y: ops[1].to.y }
2019-08-03 15:03:33 +02:00
)
let t = pointOnCurve(ops[0].to, ops[1].cp1, ops[1].cp2, ops[1].to, intersection)
let split = curve.split(t)
let side
if (first) side = split.left
else side = split.right
2018-09-04 15:21:59 +02:00
glue.curve(
new Point(side.points[1].x, side.points[1].y),
new Point(side.points[2].x, side.points[2].y),
new Point(side.points[3].x, side.points[3].y)
2019-08-03 15:03:33 +02:00
)
2018-09-04 15:21:59 +02:00
}
2019-08-03 15:03:33 +02:00
first = false
2018-09-04 14:26:45 +02:00
}
2019-08-03 15:03:33 +02:00
let joint
if (trimmedStart.length > 0) joint = joinPaths(trimmedStart, false, this.raise).join(glue)
2019-08-03 15:03:33 +02:00
else joint = glue
if (trimmedEnd.length > 0) joint = joint.join(joinPaths(trimmedEnd, false, this.raise))
2018-09-04 14:26:45 +02:00
2019-08-03 15:03:33 +02:00
return joint.trim()
2018-09-04 14:26:45 +02:00
}
}
}
2019-08-03 15:03:33 +02:00
return this
}
2018-09-04 14:26:45 +02:00
/** Applies a path translate transform */
Path.prototype.translate = function (x, y) {
if (this.debug) {
if (typeof x !== 'number')
this.raise.warning('Called `Path.translate(x, y)` but `x` is not a number')
if (typeof y !== 'number')
this.raise.warning('Called `Path.translate(x, y)` but `y` is not a number')
}
2019-08-03 15:03:33 +02:00
let clone = this.clone()
for (let op of clone.ops) {
2019-08-03 15:03:33 +02:00
if (op.type !== 'close') {
op.to = op.to.translate(x, y)
}
2019-08-03 15:03:33 +02:00
if (op.type === 'curve') {
op.cp1 = op.cp1.translate(x, y)
op.cp2 = op.cp2.translate(x, y)
}
}
2019-08-03 15:03:33 +02:00
return clone
}
2019-08-03 15:03:33 +02:00
export default Path