{"id":18286235,"url":"https://github.com/azrafe7/hxgeomalgo","last_synced_at":"2026-01-21T03:32:11.035Z","repository":{"id":14167785,"uuid":"16873811","full_name":"azrafe7/hxGeomAlgo","owner":"azrafe7","description":"Small collection of computational geometry algorithms in Haxe.","archived":false,"fork":false,"pushed_at":"2021-11-26T01:50:28.000Z","size":6023,"stargazers_count":160,"open_issues_count":2,"forks_count":13,"subscribers_count":16,"default_branch":"master","last_synced_at":"2025-02-15T00:45:29.700Z","etag":null,"topics":["comp-geom","component-labeling","computational-geometry","convex-decomposition","curve-smoothing","haxe","marching-squares","poly-decomposition","polyline-simplification","tess2","triangulation"],"latest_commit_sha":null,"homepage":"http://azrafe7.github.io/hxGeomAlgo/index.html","language":"Haxe","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/azrafe7.png","metadata":{"files":{"readme":"README.md","changelog":"CHANGELOG.md","contributing":null,"funding":".github/FUNDING.yml","license":"LICENSE.md","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null},"funding":{"github":["azrafe7"],"patreon":null,"open_collective":null,"ko_fi":null,"tidelift":null,"community_bridge":null,"liberapay":null,"issuehunt":null,"otechie":null,"custom":null}},"created_at":"2014-02-15T23:00:51.000Z","updated_at":"2024-12-27T18:47:03.000Z","dependencies_parsed_at":"2022-09-09T00:22:33.222Z","dependency_job_id":null,"html_url":"https://github.com/azrafe7/hxGeomAlgo","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/azrafe7%2FhxGeomAlgo","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/azrafe7%2FhxGeomAlgo/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/azrafe7%2FhxGeomAlgo/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/azrafe7%2FhxGeomAlgo/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/azrafe7","download_url":"https://codeload.github.com/azrafe7/hxGeomAlgo/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247988819,"owners_count":21029166,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["comp-geom","component-labeling","computational-geometry","convex-decomposition","curve-smoothing","haxe","marching-squares","poly-decomposition","polyline-simplification","tess2","triangulation"],"created_at":"2024-11-05T13:19:23.623Z","updated_at":"2026-01-21T03:32:11.005Z","avatar_url":"https://github.com/azrafe7.png","language":"Haxe","funding_links":["https://github.com/sponsors/azrafe7"],"categories":[],"sub_categories":[],"readme":"hxGeomAlgo\n==========\n\nSmall collection of computational geometry algorithms in Haxe.\n\n![](screenshot.png)\n\n\u003csup\u003e[swf demo](https://azrafe7.github.io/hxGeomAlgo/OpenflDemo.swf) | [js demo](https://azrafe7.github.io/hxGeomAlgo/index.html)\u003c/sup\u003e\n\n#### [Marching Squares (Contour Tracing)](https://en.wikipedia.org/w/index.php?title=Marching_squares\u0026oldid=342542650)\n\nBased on:\n\n - 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)\n - http://www.tomgibara.com/computer-vision/marching-squares (Java - by Tom Gibara)\n\n#### [Ramer-Douglas-Peucker (Polyline Simplification)](http://en.wikipedia.org/wiki/Ramer%E2%80%93Douglas%E2%80%93Peucker_algorithm)\n\nBased on:\n\n - http://karthaus.nl/rdp/ (JS - by Marius Karthaus)\n - http://stackoverflow.com/questions/849211/shortest-distance-between-a-point-and-a-line-segment (JS - by Grumdrig)\n\n#### [Ear Clipping (Triangulation and Poly Decomposition w/ Hole Support)](http://en.wikipedia.org/wiki/Ear_clipping#Ear_clipping_method)\n\nBased on:\n\n - https://github.com/mapbox/earcut (JS - by Vladimir Agafonkin)\n - http://www.ewjordan.com/earClip/ (Java - by Eric Jordan)\n\n#### [Bayazit (Poly Decomposition)](https://web.archive.org/web/20140810120355/http://mnbayazit.com/406/overview)\n\nBased on:\n\n - https://web.archive.org/web/20140701210122/http://mnbayazit.com/406/bayazit (C - by Mark Bayazit)\n - http://www.dyn4j.org/ (Java - by William Bittle)\n\n#### [Visibility Polygon](http://en.wikipedia.org/wiki/Visibility_polygon) and [Homogeneous Coords (2D)](http://en.wikipedia.org/wiki/Homogeneous_coordinates)\n\nBased on:\n\n - http://www.cs.ubc.ca/~snoeyink/demos/convdecomp/VPDemo.html (Java - by Jack Snoeyink)\n\n#### [Snoeyink-Keil (Minimum Convex Decomposition)](http://www.cs.ubc.ca/~snoeyink/demos/convdecomp/MCDDemo.html)\n\nBased on:\n\n   - http://www.cs.ubc.ca/~snoeyink/demos/convdecomp/MCDDemo.html  (Java - by Jack Snoeyink \u0026 Mark Keil)\n   - [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)\n\n#### [Connected Components Labeling and Contour Tracing (w/ Hole Support)](http://en.wikipedia.org/wiki/Connected-component_labeling)\n\nBased on:\n\n - 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)\n\n#### [Visvalingam-Whyatt (Polyline Simplification)](http://bost.ocks.org/mike/simplify/)\n\nBased on:\n\n - Visvalingam M., Whyatt J. D.: [Line generalisation by repeated elimination of the smallest area](https://hydra.hull.ac.uk/resources/hull:8338) (1992)\n - http://bost.ocks.org/mike/simplify/ (JS - by Mike Bostock)\n - https://github.com/jonasmalacofilho/dheap (Haxe - by Jonas Malaco Filho)\n - http://en.wikipedia.org/wiki/Binary_heap (Binary (Min)Heap)\n\n#### [Tess2 (Tesselation to Triangles and Convex Polygons, Poly Boolean Ops)](https://rawgit.com/azrafe7/tess2.js/master/test/index.html)\n\nBased on:\n\n - GLU Libtess (by Eric Veach, July 1994)\n - [tess2.js](https://github.com/memononen/tess2.js) (JS - by Mikko Mononen, Aug 2013)\n\n#### [IsoContours (Contour Tracing)](https://en.wikipedia.org/wiki/Contour_line)\n\nBased on:\n\n - http://en.wikipedia.org/wiki/Marching_squares\n - https://github.com/deltaluca/nape (Haxe - by Luca Deltodesco)\n - https://github.com/scikit-image/scikit-image\t(Python - by scikit-image team)\n\n#### [Hertel-Mehlhorn (Convex Polygons from Arbitrary Triangulation)](https://www8.cs.umu.se/kurser/TDBA77/VT06/algorithms/BOOK/BOOK5/NODE194.HTM)\n\nBased on:\n\n - https://github.com/ivanfratric/polypartition (CPP - by Ivan Fratric)\n - https://web.archive.org/web/20140102033642/http://www.philvaz.com/compgeom/ (by Phil Porvaznik)\n\n#### [Chaikin (Recursive Curve Smoothing)](https://observablehq.com/@pamacha/chaikins-algorithm)\n\nBased on:\n\n - George Merrill Chaikin: [An algorithm for high-speed curve generation](https://sci-hub.st/10.1016/0146-664X(74)90028-8) (1974)\n - https://sighack.com/post/chaikin-curves (Java - by Manohar Vanga)\n\n#### [Wu-Yong-Zhang-Zhang (Multi-step Chaikin Curve Smoothing)](https://observablehq.com/@pamacha/chaikins-algorithm)\n\nBased on:\n\n - 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)\n - http://win.doomitalia.it/varie/chaikin.pdf (Matlab - by Fabio Roman, 2009)\n\n## Dependencies\nThe only dependency is [hxPixels](https://github.com/azrafe7/hxPixels), and only for the algorithms needing access to pixels.\n\n## Usage\nCode is extensively doc-commented, and I tried my best to make it easy/intuitive to use.\nYou can also take a look at the demo for a quick overview on how to use the different classes.\n\n## Credits\n\n**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.\n\n## License\n\n**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. \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fazrafe7%2Fhxgeomalgo","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fazrafe7%2Fhxgeomalgo","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fazrafe7%2Fhxgeomalgo/lists"}