Jürg Lehni
|
cae4520665
|
Simplify addCurveLineIntersections() code.
|
2013-09-22 18:18:03 -07:00 |
|
hkrish
|
f9b4321a56
|
Boolean -fix: Interpolate to find the parameter of intersection in linear curve segments
|
2013-09-21 17:26:14 +02:00 |
|
hkrish
|
0a22211393
|
Conform to paperjs coding style.
|
2013-09-21 15:26:14 +02:00 |
|
hkrish
|
669fb1638a
|
Boolean -fix: Preserve the order of intersections found (Curve-Line) according to the PathItem they belong to.
|
2013-09-13 02:44:51 +02:00 |
|
Jürg Lehni
|
19c7788617
|
Fix documentation irregularities.
|
2013-08-23 19:45:28 -07:00 |
|
Jürg Lehni
|
6b19f25f4b
|
Fix typos in comments.
|
2013-08-08 15:21:35 -07:00 |
|
Jürg Lehni
|
ef4eee1064
|
Pass true for isParameter in Curve#divide() calls.
Closes #252.
|
2013-07-04 19:39:55 -07:00 |
|
Jürg Lehni
|
6833e9d8e0
|
Fix {@default 0.5} values in documentation.
|
2013-06-27 18:15:10 -07:00 |
|
Jürg Lehni
|
f9925a71ea
|
Improve documentation for Path#split(), Curve#divide() and Curve#split().
Closes #189.
|
2013-06-27 17:18:57 -07:00 |
|
Jürg Lehni
|
9f5b543ab5
|
Fix getCurveAt() signature.
|
2013-06-27 17:13:00 -07:00 |
|
Jürg Lehni
|
38db18c2e1
|
Remove isParameter from Curve.evaluate()
|
2013-06-27 17:12:35 -07:00 |
|
Jürg Lehni
|
52c889428b
|
Remove Curve.create() in favor of direct constructor.
|
2013-06-25 09:54:13 -07:00 |
|
Jürg Lehni
|
1866e4ff15
|
Remove need for all special arguments in minification, and restructure code to avoid warnings.
|
2013-06-24 10:15:54 -07:00 |
|
Jürg Lehni
|
a4535edbb9
|
Bring back _class names, since code minification breaks reliance on constructor.name.
Closes #248.
|
2013-06-23 20:18:32 -07:00 |
|
Jürg Lehni
|
258c404b98
|
Move curvature calculations into Curve.evaluate(), and define unit tests for it.
|
2013-06-18 19:00:05 -07:00 |
|
Jürg Lehni
|
619a8f88f8
|
Clean up code a bit in Curve#getCurvatureAt().
|
2013-06-18 18:29:44 -07:00 |
|
hkrish
|
d4d2075040
|
Fix: Use absolute coordinates from #Curve.getValues() directly while calculating the curvature
|
2013-06-17 22:27:20 +05:30 |
|
Jürg Lehni
|
8a726f22b2
|
Clean up comments.
|
2013-06-17 08:57:30 -07:00 |
|
Jürg Lehni
|
b072df0486
|
Put isEnd value directly into conditional.
|
2013-06-17 08:56:42 -07:00 |
|
Jürg Lehni
|
18ad8a235d
|
Clean up code to follow Paper.js coding conventions.
|
2013-06-17 08:26:51 -07:00 |
|
Jürg Lehni
|
be6bbb802d
|
Move calculations of values to where they are needed.
|
2013-06-17 08:22:28 -07:00 |
|
Jürg Lehni
|
5ff990a84a
|
Fix global variable leakage, and join sequential variable definitions.
|
2013-06-17 08:10:57 -07:00 |
|
hkrish
|
2693516844
|
Implement correct method for calculating curvature on a Path
|
2013-06-17 15:16:11 +05:30 |
|
Jürg Lehni
|
eb32bad57e
|
Fix imprecision in #getNearestLocation()
|
2013-06-15 03:12:29 -07:00 |
|
Jürg Lehni
|
1dee05900f
|
Move getArea code to other statics block.
|
2013-06-13 23:16:44 -07:00 |
|
Jürg Lehni
|
610e396d94
|
Make Curve#_getCrossings() a static method and have it work on curve values directly.
|
2013-06-13 23:16:00 -07:00 |
|
Jürg Lehni
|
01e48b3322
|
Improve and clean up fat-line bug fix.
|
2013-06-13 15:53:28 -07:00 |
|
Jürg Lehni
|
95ecab8a6f
|
Improve handling of merged CompoundPath style through #getStyle().
Only access _style directly in core code if you really know what you're doing!
|
2013-06-12 20:12:08 -07:00 |
|
Jürg Lehni
|
f45a66d2ee
|
Filter out curves with zero length in Path#contains() algorithm.
Fixes #227
|
2013-06-12 00:19:54 -07:00 |
|
Jürg Lehni
|
7faf2a9e70
|
Clean-up @hkrish's changes a bit.
|
2013-06-09 18:37:08 -07:00 |
|
hkrish
|
d8498b6418
|
Remove invalid code and unnecessary comments
|
2013-06-09 22:02:50 +05:30 |
|
hkrish
|
d3405115c1
|
Use parameter on both curves in CurveLocation objects instead of Point in #getIntersection()
|
2013-06-08 21:37:43 +05:30 |
|
Jürg Lehni
|
cd7db56249
|
Remove all create() constructors for basic types since new constructors are now faster.
Woop!
|
2013-05-27 23:57:31 -07:00 |
|
Jürg Lehni
|
10d5de3ed6
|
Implement a better way to name and export class constructors.
This change also simplified the way classes are exported to PaperScope objects.
|
2013-05-27 12:48:58 -07:00 |
|
Jürg Lehni
|
f9267e7f5c
|
Some more code clean up and variable renaming.
|
2013-05-26 17:59:01 -07:00 |
|
Jürg Lehni
|
14962b5c45
|
Clean up code a bit more.
|
2013-05-26 17:52:05 -07:00 |
|
Jürg Lehni
|
32709a176b
|
Fix some comments.
|
2013-05-26 17:48:36 -07:00 |
|
Jürg Lehni
|
7050edd6e4
|
Fix point sequence.
|
2013-05-26 17:40:40 -07:00 |
|
Jürg Lehni
|
90f0679700
|
Further simplify getConvexHull() by using p0 … p3 point objects.
|
2013-05-26 17:39:13 -07:00 |
|
Jürg Lehni
|
487c4c4aef
|
Further simplify getConvexHull() by inlining cross product calculations.
|
2013-05-26 17:32:44 -07:00 |
|
Jürg Lehni
|
9edab9c3aa
|
Simplify convex hull algorithm by returning lists of points rather than lines.
We can avoid some data redundancy that way at no performance cost.
|
2013-05-26 17:18:54 -07:00 |
|
Jürg Lehni
|
9540b7f6a9
|
Use addLineIntersection() in subdivision algorithm as well.
|
2013-05-26 17:10:29 -07:00 |
|
Jürg Lehni
|
20737c6664
|
Rename various intersection methods.
|
2013-05-26 17:06:23 -07:00 |
|
Jürg Lehni
|
5d7cc2fb40
|
Use new Line.getSignedDistance().
|
2013-05-26 16:58:49 -07:00 |
|
Jürg Lehni
|
80f9f6061c
|
Change the way the Line class handles direction vectors and infinite lines.
The beginning of performance improvements in the Line class.
|
2013-05-26 15:44:52 -07:00 |
|
Jürg Lehni
|
1fb0a3a13c
|
Always provide t parameter for CurveLocations if we know it.
|
2013-05-25 11:23:59 -07:00 |
|
Jürg Lehni
|
502c76dbce
|
Start merging fat-line clipping code into Curve class.
And add a prepro option for now.
|
2013-05-24 22:30:13 -07:00 |
|
Jürg Lehni
|
7e5f846190
|
Remove debugging code.
|
2013-05-24 17:57:13 -07:00 |
|
Jürg Lehni
|
bd3ac02bbe
|
Use Curve instead of this.
Compresses better and allows passing on function as callback.
|
2013-05-24 17:52:05 -07:00 |
|
Harikrishnan Gopalakrishnan
|
ce600f4ea4
|
Fix: #initialize() to correctly convert #getValue() array back to Curve object.
|
2013-05-11 00:59:30 +03:00 |
|
Jürg Lehni
|
7b8e27ddd9
|
Further simplify getNearestPoint() algorithm.
|
2013-05-07 00:07:18 -07:00 |
|
Jürg Lehni
|
3a7547a255
|
Bring back accidentally removed static functions on Curve.
|
2013-05-05 23:14:49 -07:00 |
|
Jürg Lehni
|
db42dfdfc1
|
Implement simpler strategy to iteratively find nearest points on paths.
Idea based on method described on http://pomax.github.io/bezierinfo/
|
2013-05-05 23:05:57 -07:00 |
|
Jürg Lehni
|
f704b00e00
|
Implement static Line.intersect() and use it to speed up Curve.getIntersections()
Unfortunately doesn't seem to have any impact!
|
2013-05-04 10:22:10 -07:00 |
|
Jürg Lehni
|
85de8a0b7d
|
Clean up Curve#divide() code.
|
2013-05-03 21:00:46 -07:00 |
|
Jürg Lehni
|
3101989974
|
Adjust precision of Curve#isFlatEnough() to cover rare edge cases.
|
2013-05-03 21:00:37 -07:00 |
|
hkrish
|
e75cc32a3b
|
Merge branch 'master' of https://github.com/paperjs/paper.js
* 'master' of https://github.com/paperjs/paper.js:
Undo recent change to Curve#getIntersection() since it breaks some boolean operations.
ý5:q
|
2013-05-03 19:24:03 +02:00 |
|
Jürg Lehni
|
840e879ba8
|
Undo recent change to Curve#getIntersection() since it breaks some boolean operations.
|
2013-05-02 11:32:24 -07:00 |
|
hkrish
|
10553c1bd8
|
Merge upstream
|
2013-05-02 14:18:24 +02:00 |
|
Jürg Lehni
|
e8fed1bdf0
|
Improve Curve#getIntersections() by avoiding further subdivision of flat curves.
|
2013-05-01 18:40:57 -07:00 |
|
Jürg Lehni
|
c61e8d57b9
|
Fix issue with recursive call of Curve.getIntersections().
|
2013-05-01 18:24:54 -07:00 |
|
hkrish
|
f239a3980d
|
Fix: Update the getIntersections method signature in recursive calls
|
2013-05-01 13:29:02 +02:00 |
|
Jürg Lehni
|
883e3ad563
|
Define CurveLocation#intersection as a way to retrieve the CurveLocation on the intersecting path when using Path#getIntersections().
|
2013-04-30 18:41:26 -07:00 |
|
Jürg Lehni
|
c7ab32c501
|
Rearrange linear curve conditions.
|
2013-04-26 14:37:37 -07:00 |
|
Jürg Lehni
|
c513a24f46
|
Handle intersection between linear curves without recursive subdivision.
Closes #207.
|
2013-04-26 14:31:42 -07:00 |
|
Jürg Lehni
|
74f6a93b33
|
Optimize Curve.getArea().
|
2013-04-25 17:47:11 -07:00 |
|
Jürg Lehni
|
898e216668
|
Implement Path#getArea() and CompoundPath#getArea().
|
2013-04-25 17:37:19 -07:00 |
|
Jürg Lehni
|
80a1129eab
|
Consistently use 'this' rather than 'Curve'.
|
2013-04-25 17:19:00 -07:00 |
|
Jürg Lehni
|
1b5ca4dec9
|
Rename Curve._addIntersections() to Curve.getIntersections()
|
2013-04-25 17:17:53 -07:00 |
|
Jürg Lehni
|
eaa6e3bb6b
|
Improve Curve#getCrossings() documentation and code.
|
2013-04-25 11:08:50 -07:00 |
|
Jürg Lehni
|
d7e075d316
|
Handle contour edge cases in Path#contains().
Closes #208.
|
2013-04-25 11:03:49 -07:00 |
|
Jürg Lehni
|
dc9a9c42d2
|
Cleanup solveCubic() further.
|
2013-04-21 08:44:41 -07:00 |
|
Jonathan Puckey
|
52e7c39567
|
Improve Curve documentation.
|
2013-04-21 15:43:57 +02:00 |
|
Jürg Lehni
|
c45ad26b67
|
Remove tolerance parameter from solveCubic() / solveQuadratic() since we should always use EPSILON.
|
2013-04-20 19:58:42 -07:00 |
|
Jürg Lehni
|
14aa8e5dea
|
Improve precision of Numerical.solveCubic() and fix issues in Curve.getCrossings().
Closes #202.
|
2013-04-20 19:14:19 -07:00 |
|
Jürg Lehni
|
461def5383
|
Fix issue with imprecise tangents / normals to curves at t = 0, 1.
|
2013-04-20 17:40:19 -07:00 |
|
Jürg Lehni
|
1952e3dc7d
|
Implement Curve#getCurvatureAt().
|
2013-04-20 17:26:51 -07:00 |
|
Jürg Lehni
|
9fe1ff951a
|
Clean up code.
|
2013-04-09 20:36:38 -07:00 |
|
Jürg Lehni
|
7f245974e6
|
Implement a faster method to filter out beginnings of intersected curves.
|
2013-04-09 20:35:31 -07:00 |
|
Jürg Lehni
|
a9a0857ba4
|
Find a better strategy to avoid duplicate solutions in PathItem#getIntersections().
Closes #197.
|
2013-04-09 20:27:55 -07:00 |
|
Jürg Lehni
|
d3bb68d0e0
|
Use faster Array construction.
|
2013-04-09 07:55:09 -07:00 |
|
Jürg Lehni
|
a0b903e49c
|
Simply call slice() instead of slice(0).
|
2013-04-06 18:39:17 +02:00 |
|
Jürg Lehni
|
e854254986
|
Insert linear segments when dividing linear curves.
|
2013-03-19 16:17:12 -07:00 |
|
Jürg Lehni
|
2230c2888d
|
Fix issue with Curve#divide() where the wrong curve reference is returned.
|
2013-03-01 20:19:44 -08:00 |
|
Jürg Lehni
|
02ca95eb46
|
Avoid accidental global leakage.
|
2013-02-08 16:12:57 -08:00 |
|
Jürg Lehni
|
6c9c16ad3d
|
Update copyright information comments, and year.
|
2013-01-28 18:03:27 -08:00 |
|
Jürg Lehni
|
b0deda9445
|
Add missing documentation for various location related functions on Curve.
|
2013-01-28 16:47:45 -08:00 |
|
Jürg Lehni
|
c7d8aebb9e
|
Swap Curve's bounds scope with point evaluation scope, for proximity to bounds related methods in scope before.
|
2013-01-28 16:32:04 -08:00 |
|
Jürg Lehni
|
1a438b8b9b
|
Change Curve#[getPoint / getTangent / getNormal](t) to #[getPoint / getTangent / getNormal](offset, isParamter).
Keep deprecated versions around for now.
|
2013-01-28 16:30:28 -08:00 |
|
Jürg Lehni
|
f09bc84a12
|
Implement correct handling of Curves / Segments synchronization, improve CurveLocation linking to Curves through their linked Segments, and preserve Curves in Path#split() calls.
|
2013-01-22 14:46:49 -08:00 |
|
Jürg Lehni
|
ba5aa86411
|
Include Roger Willcocks in the thanks regarding isSufficentlyFlat.
|
2013-01-20 14:28:02 -08:00 |
|
Jürg Lehni
|
b05a21d6c9
|
Fix bug in Curve#getLocationOf().
|
2013-01-20 14:01:42 -08:00 |
|
Jürg Lehni
|
b04eb2b98f
|
Implement Path#split() and Curve#split().
|
2012-12-31 22:28:41 +01:00 |
|
Jürg Lehni
|
e066db4577
|
Implement Curve#divide().
|
2012-12-30 19:49:17 +01:00 |
|
Jürg Lehni
|
4185b63d99
|
Und recent renaming of #getNearest*() methods.
|
2012-12-30 19:43:35 +01:00 |
|
Jürg Lehni
|
2abefee336
|
Merge Base.readValue() with Base.read() and rename Base.peekValue() to Base.peek().
When called directly on Base, read() reads values, otherwise the specific type of the subclass it is called on.
|
2012-12-30 16:07:20 +01:00 |
|
Jürg Lehni
|
1b539301ad
|
Find a better naming convention for the various getLocation* methods (*At for offsets / parameters, *Of for points), implement the missing methods on Curve and use them in Path.
|
2012-12-27 21:08:03 +01:00 |
|
Jürg Lehni
|
231369fa01
|
Shorten code a bit, using loops.
|
2012-12-27 20:46:12 +01:00 |
|
Jürg Lehni
|
cb8f3291d3
|
Clean up some comments.
|
2012-12-27 20:19:23 +01:00 |
|
Jürg Lehni
|
5b9d33f32e
|
Fix imprecision in intersection code by re-introducing tolerance parameter in Curve#isFlatEnough().
|
2012-12-27 20:13:45 +01:00 |
|