diff --git a/README.md b/README.md new file mode 100644 index 0000000..294f1c3 --- /dev/null +++ b/README.md @@ -0,0 +1,37 @@ +
Based on the paper "Sweep-line algorithm for constrained Delaunay triangulation" by +V. Domiter and and B. Zalik
+ +Officially supported langs: C++, Java
+ + + + + +Community based langs (unsupported):
+ * AS3
+ * C
+ * C#, C#(basic)
+ * Go
+ * Haxe
+ * Javascript
+ * Python, Python3
+ * Ruby
Try it out online: click me or me!
+ +Image +01 +02 +Video +poly2tri-java
+ +If you want to triangulate complex or weak polygons you will need to prepare your data
+with a polygon clipping library like:
+Clipper (C++, C#, Delphi)
+Javascript Clipper
+Java Clipper