33 commits

Author	SHA1	Message	Date
Jürg Lehni	e22fa3a664	Update copyright notice.	2014-01-04 01:47:16 +01:00
Jürg Lehni	8395541298	Clean up docs and fix spelling mistakes.	2013-12-29 15:44:26 +01: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	8d2c2f5fda	Fix an issue with PathFitter where path with only one segment would throw an error. ... Closes #175.	2013-03-01 14:28:32 -08:00
Jürg Lehni	6c9c16ad3d	Update copyright information comments, and year.	2013-01-28 18:03:27 -08:00
Jürg Lehni	57a9f4fc91	Use constant substitution for Numerical constants as well.	2012-12-27 18:36:59 +01:00
Jürg Lehni	64b9daacd0	Code clean-up.	2012-11-05 21:06:56 -08:00
Jono Brandel	ad811827fc	Based on logic, I think the else if statement means to refer to c1 rather than c0 again, but I'd like to verify with you guys.	2012-02-07 09:10:33 -08:00
Jürg Lehni	c4bea4d24c	Include comment about algorithm modifications.	2011-11-10 18:30:18 +01:00
Jürg Lehni	3a7c5286b5	Improve precision of Line#intersect() and other parts that check for a divisor to not be 0, by comparing against the new Numerical.EPSILON rather than Numerical.TOLERANCE.	2011-07-28 11:03:59 +01:00
Jürg Lehni	79c0ad8cc5	Update copyright notices.	2011-07-01 12:17:45 +02:00
Richard D. Worth	ac39873693	Whitespace. Removed all trailing whitespace from .js files	2011-06-30 06:01:51 -04:00
Jürg Lehni	7cd749e63d	Change all documentation to new convention of defining @class outside injection scope, fix some comments and a few errors with examples.	2011-06-22 23:56:05 +01:00
Jürg Lehni	065777291e	Fix filtering of duplace points in path fitting code.	2011-06-12 18:40:24 +01:00
Jürg Lehni	928b7df01e	Fix typo introduced in previous refactoring.	2011-06-06 17:18:22 +01:00
Jürg Lehni	046f9cef6e	Add comments.	2011-06-05 23:14:36 +01:00
Jürg Lehni	2fe21586df	Further simplifications of path fitter code.	2011-06-05 23:14:28 +01:00
Jürg Lehni	3a4af3f854	Rename variables forgotten in previous refactoring.	2011-06-05 23:13:45 +01:00
Jürg Lehni	b035077d31	Simplify code.	2011-06-05 23:00:33 +01:00
Jürg Lehni	9e25047b91	Further clean ups.	2011-06-05 22:09:19 +01:00
Jürg Lehni	68eb14c00d	Clean up code.	2011-06-05 22:06:24 +01:00
Jürg Lehni	10e1417dc2	Check for denominator == 0 with tolerance.	2011-06-05 21:59:42 +01:00
Jürg Lehni	73a188742e	Fix bug in singularity check.	2011-06-05 21:56:04 +01:00
Jürg Lehni	ee7147d58e	Rename forgotten variables in previous refactoring.	2011-06-05 21:51:01 +01:00
Jürg Lehni	6ea63fde43	Handle case of nearly singular matrix separately.	2011-06-05 21:45:29 +01:00
Jürg Lehni	27c7248a2d	Clean up and shorten code.	2011-06-05 21:44:34 +01:00
Jürg Lehni	bcb5df9f04	Clean up.	2011-06-05 21:31:58 +01:00
Jürg Lehni	ca18b20785	Remove Douglas–Peucker algorithm again since it produced ackward results.	2011-06-05 21:29:19 +01:00
Jürg Lehni	42f5b5e26e	Implement Douglas–Peucker algorithm for point reduction before the curve fitting.	2011-06-05 21:28:49 +01:00
Jürg Lehni	aef8dcf2d3	Check for determinant singularity and handle separately.	2011-06-05 21:27:24 +01:00
Jürg Lehni	7d2742cd94	Rename PathFitter#process() -> #fit().	2011-06-05 21:26:01 +01:00
Jürg Lehni	4854e56e1d	Filter out adjacent duplicate points.	2011-06-05 21:25:38 +01:00
Jürg Lehni	28c680ac94	Implement PathFitter and Path#pointsToCurves().	2011-06-05 19:27:18 +01:00