This is a C++11 library for triangulating simple polygons (i.e. not self-intersecting, no holes) in 2D.

It is small and only requires a minimum of memory for triangulation.

Memory consumption is in O(log n). Time complexity is between O(n log n) for convex polygons and O(n^3) in the worst case.

Features

  • polygon triangulation

Project Activity

See All Activity >

Categories

Libraries

License

MIT License

Follow triangulate

triangulate Web Site

Other Useful Business Software
Custom VMs From 1 to 96 vCPUs With 99.95% Uptime Icon
Custom VMs From 1 to 96 vCPUs With 99.95% Uptime

General-purpose, compute-optimized, or GPU/TPU-accelerated. Built to your exact specs.

Live migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
Start Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of triangulate!

Additional Project Details

Registered

2019-01-07