This is demo of polygons intersection algorithm written in JS. Visual part of project based on template provided by kottans.org. Demo site is available via GitHub Pages here: [vrd.github.io/js-intersect] (http://vrd.github.io/js-intersect).
Project consists of following files:
- index.html - main demo page
- test.html - page with test results for checking algorithm correctness
- index.js - code for drawing polygons and calling intersects() function
- solution.js - script with
intersect()function and many other functions that realize algorithm - test.js - script with tests
- index.css - styles for index.html
- test.css - styles for test.html
Function intersect() in file solution.js is a top-level function of an algotithm. Function takes two arguments. Each argument is a polygon given in a form of list of its vertices. Every vertex is an object with two keys: "x" and "y". Example of polygon:
[{x: 100, y: 200}, {x: 150, y: 200}, {x: 150, y: 270}] Polygon can consist of 3 to 100 vertices.
Function returns list of polygons (result of polygons intersection) in same format.
P.S. Algorithm can perform not only intersection of two polygons but other actions: union, complement etc. Look at function filterPolygons() in file solution.js for more information.