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

You Might Also Like
Find out just how much your login box can do for your customer | Auth0 Icon
Find out just how much your login box can do for your customer | Auth0

With over 53 social login options, you can fast-track the signup and login experience for users.

From improving customer experience through seamless sign-on to making MFA as easy as a click of a button – your login box must find the right balance between user convenience, privacy and security.
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