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 |
|