Release 0.8.0

Author: jriecken

CHANGELOG.md

@@ -1,5 +1,10 @@
 # Changelog
 
+## 0.8.0 (Sept 7, 2019)
+
+- Combine consecutive duplicate points in polygons to remove zero-length edges. (Fixes #55)
+- Add the ability to set an offset for circles - thanks [funnisimo](https://github.com/funnisimo)!
+
 ## 0.7.1 (May 23, 2018)
 
 - Check explicitly for `undefined` `y` param when scaling vectors. (Fixes #52)

README.md

@@ -16,7 +16,7 @@ It also supports checking whether a point is inside a circle or polygon.
 
 It's released under the [MIT](http://en.wikipedia.org/wiki/MIT_License) license.
 
-Current version: `0.7.1`. [Annotated source code](http://jriecken.github.io/sat-js/docs/SAT.html) is available.
+Current version: `0.8.0`.
 
 Nicely compresses with the [Google Closure Compiler](https://developers.google.com/closure/compiler/) in **Advanced** mode to about 6KB (2KB gzipped)
 
@@ -90,7 +90,9 @@ var p = new SAT.Polygon(new SAT.Vector(), [
 
 Note: The points are counter-clockwise *with respect to the coordinate system*. If you directly draw the points on a screen that has the origin at the top-left corner it will _appear_ visually that the points are being specified clockwise. This is just because of the inversion of the Y-axis when being displayed.
 
-You can create a line segment by creating a `Polygon` that contains only 2 ppoints.
+You can create a line segment by creating a `Polygon` that contains only 2 points.
+
+Any identical consecutive points will be combined. (this can happen if you convert a `Box` with zero width or height into a `Polygon`)
 
 It has the following properties:
 
@@ -298,16 +300,13 @@ SAT.pointInPolygon(new V(0,0), triangle); // false
 SAT.pointInPolygon(new V(35, 5), triangle); // true
 SAT.pointInCircle(new V(0,0), circle); // false
 SAT.pointInCircle(new V(110,110), circle); // true
-
 ```
 
-Tests
------
+## Tests
 
 To run the tests from your console:
 
 ```
-mocha
+npm install
+npm run test
 ```
-
-To install `mocha` you will need to have run `npm install` after cloning the repo.

SAT.js

@@ -1,10 +1,10 @@
-// Version 0.7.1 - Copyright 2012 - 2018 -  Jim Riecken <jimr@jimr.ca>
+// Version 0.8.0 - Copyright 2012 - 2018 -  Jim Riecken <jimr@jimr.ca>
 //
 // Released under the MIT License - https://github.com/jriecken/sat-js
 //
 // A simple library for determining intersections of circles and
 // polygons using the Separating Axis Theorem.
-/** @preserve SAT.js - Version 0.7.1 - Copyright 2012 - 2018 - Jim Riecken <jimr@jimr.ca> - released under the MIT License. https://github.com/jriecken/sat-js */
+/** @preserve SAT.js - Version 0.8.0 - Copyright 2012 - 2018 - Jim Riecken <jimr@jimr.ca> - released under the MIT License. https://github.com/jriecken/sat-js */
 
 /*global define: false, module: false*/
 /*jshint shadow:true, sub:true, forin:true, noarg:true, noempty:true,

SAT.min.js

@@ -1,7 +1,7 @@
 {
   "name": "sat",
   "description": "Library for performing 2D collision detection",
-  "version": "0.7.1",
+  "version": "0.8.0",
   "author": "Jim Riecken <jriecken@gmail.com>",
   "keywords": [
     "collision detection",