Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/azrafe7/hxgeomalgo

Small collection of computational geometry algorithms in Haxe.
https://github.com/azrafe7/hxgeomalgo

comp-geom component-labeling computational-geometry convex-decomposition curve-smoothing haxe marching-squares poly-decomposition polyline-simplification tess2 triangulation

Last synced: about 1 month ago
JSON representation

Small collection of computational geometry algorithms in Haxe.

Host: GitHub
URL: https://github.com/azrafe7/hxgeomalgo
Owner: azrafe7
License: other
Created: 2014-02-15T23:00:51.000Z (almost 11 years ago)
Default Branch: master
Last Pushed: 2021-11-26T01:50:28.000Z (about 3 years ago)
Last Synced: 2024-11-05T13:22:37.279Z (3 months ago)
Topics: comp-geom, component-labeling, computational-geometry, convex-decomposition, curve-smoothing, haxe, marching-squares, poly-decomposition, polyline-simplification, tess2, triangulation
Language: Haxe
Homepage: http://azrafe7.github.io/hxGeomAlgo/index.html
Size: 5.74 MB
Stars: 159
Watchers: 16
Forks: 13
Open Issues: 2
Metadata Files:
- Readme: README.md
- Changelog: CHANGELOG.md
- Funding: .github/FUNDING.yml
- License: LICENSE.md

Awesome Lists containing this project

README

        hxGeomAlgo

==========

Small collection of computational geometry algorithms in Haxe.

![](screenshot.png)

^{[swf demo](https://azrafe7.github.io/hxGeomAlgo/OpenflDemo.swf) | [js demo](https://azrafe7.github.io/hxGeomAlgo/index.html)}

#### [Marching Squares (Contour Tracing)](https://en.wikipedia.org/w/index.php?title=Marching_squares&oldid=342542650)

Based on:

 - https://web.archive.org/web/20180316055432/http://devblog.phillipspiess.com/better%20know%20an%20algorithm/2010/02/23/better-know-marching-squares.html (C# - by Phil Spiess)

 - http://www.tomgibara.com/computer-vision/marching-squares (Java - by Tom Gibara)

#### [Ramer-Douglas-Peucker (Polyline Simplification)](http://en.wikipedia.org/wiki/Ramer%E2%80%93Douglas%E2%80%93Peucker_algorithm)

Based on:

 - http://karthaus.nl/rdp/ (JS - by Marius Karthaus)

 - http://stackoverflow.com/questions/849211/shortest-distance-between-a-point-and-a-line-segment (JS - by Grumdrig)

#### [Ear Clipping (Triangulation and Poly Decomposition w/ Hole Support)](http://en.wikipedia.org/wiki/Ear_clipping#Ear_clipping_method)

Based on:

 - https://github.com/mapbox/earcut (JS - by Vladimir Agafonkin)

 - http://www.ewjordan.com/earClip/ (Java - by Eric Jordan)

#### [Bayazit (Poly Decomposition)](https://web.archive.org/web/20140810120355/http://mnbayazit.com/406/overview)

Based on:

 - https://web.archive.org/web/20140701210122/http://mnbayazit.com/406/bayazit (C - by Mark Bayazit)

 - http://www.dyn4j.org/ (Java - by William Bittle)

#### [Visibility Polygon](http://en.wikipedia.org/wiki/Visibility_polygon) and [Homogeneous Coords (2D)](http://en.wikipedia.org/wiki/Homogeneous_coordinates)

Based on:

 - http://www.cs.ubc.ca/~snoeyink/demos/convdecomp/VPDemo.html (Java - by Jack Snoeyink)

#### [Snoeyink-Keil (Minimum Convex Decomposition)](http://www.cs.ubc.ca/~snoeyink/demos/convdecomp/MCDDemo.html)

Based on:

   - http://www.cs.ubc.ca/~snoeyink/demos/convdecomp/MCDDemo.html  (Java - by Jack Snoeyink & Mark Keil)

   - [J. Mark Keil](http://www.informatik.uni-trier.de/~ley/pers/hd/k/Keil:J=_Mark), [Jack Snoeyink](http://www.informatik.uni-trier.de/~ley/pers/hd/s/Snoeyink:Jack.html): On the Time Bound for Convex Decomposition of Simple Polygons. [Int. J. Comput. Geometry Appl. 12](http://www.informatik.uni-trier.de/~ley/db/journals/ijcga/ijcga12.html#KeilS02)(3): 181-192 (2002)

#### [Connected Components Labeling and Contour Tracing (w/ Hole Support)](http://en.wikipedia.org/wiki/Connected-component_labeling)

Based on:

 - Fu Chang, Chun-jen Chen, Chi-jen Lu: [A linear-time component-labeling algorithm using contour tracing technique](http://www.iis.sinica.edu.tw/papers/fchang/1362-F.pdf) (2004)

#### [Visvalingam-Whyatt (Polyline Simplification)](http://bost.ocks.org/mike/simplify/)

Based on:

 - Visvalingam M., Whyatt J. D.: [Line generalisation by repeated elimination of the smallest area](https://hydra.hull.ac.uk/resources/hull:8338) (1992)

 - http://bost.ocks.org/mike/simplify/ (JS - by Mike Bostock)

 - https://github.com/jonasmalacofilho/dheap (Haxe - by Jonas Malaco Filho)

 - http://en.wikipedia.org/wiki/Binary_heap (Binary (Min)Heap)

#### [Tess2 (Tesselation to Triangles and Convex Polygons, Poly Boolean Ops)](https://rawgit.com/azrafe7/tess2.js/master/test/index.html)

Based on:

 - GLU Libtess (by Eric Veach, July 1994)

 - [tess2.js](https://github.com/memononen/tess2.js) (JS - by Mikko Mononen, Aug 2013)

#### [IsoContours (Contour Tracing)](https://en.wikipedia.org/wiki/Contour_line)

Based on:

 - http://en.wikipedia.org/wiki/Marching_squares

 - https://github.com/deltaluca/nape (Haxe - by Luca Deltodesco)

 - https://github.com/scikit-image/scikit-image	(Python - by scikit-image team)

#### [Hertel-Mehlhorn (Convex Polygons from Arbitrary Triangulation)](https://www8.cs.umu.se/kurser/TDBA77/VT06/algorithms/BOOK/BOOK5/NODE194.HTM)

Based on:

 - https://github.com/ivanfratric/polypartition (CPP - by Ivan Fratric)

 - https://web.archive.org/web/20140102033642/http://www.philvaz.com/compgeom/ (by Phil Porvaznik)

#### [Chaikin (Recursive Curve Smoothing)](https://observablehq.com/@pamacha/chaikins-algorithm)

Based on:

 - George Merrill Chaikin: [An algorithm for high-speed curve generation](https://sci-hub.st/10.1016/0146-664X(74)90028-8) (1974)

 - https://sighack.com/post/chaikin-curves (Java - by Manohar Vanga)

#### [Wu-Yong-Zhang-Zhang (Multi-step Chaikin Curve Smoothing)](https://observablehq.com/@pamacha/chaikins-algorithm)

Based on:

 - Ling Wu, Jun-Hai Yong, You-Wei Zhang, and Li Zhang: [Multi-step Subdivision Algorithm for Chaikin Curves](https://sci-hub.st/10.1007/978-3-540-30497-5_188) (2004)

 - http://win.doomitalia.it/varie/chaikin.pdf (Matlab - by Fabio Roman, 2009)

## Dependencies

The only dependency is [hxPixels](https://github.com/azrafe7/hxPixels), and only for the algorithms needing access to pixels.

## Usage

Code is extensively doc-commented, and I tried my best to make it easy/intuitive to use.

You can also take a look at the demo for a quick overview on how to use the different classes.

## Credits

**hxGeomAlgo** is based on the work of many developers and it wouldn't exist if it weren't for them. See the [CREDITS](CREDITS.md) file for details.

## License

**hxGeomAlgo** is developed by Giuseppe Di Mauro (azrafe7) and released under the MIT license (except for `Tess2.hx`, which is licensed under SGI B 2.0). See the [LICENSE](LICENSE.md) file for details.