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
Top-Rated Free CRM Software Icon
Top-Rated Free CRM Software

216,000+ customers in over 135 countries grow their businesses with HubSpot

HubSpot is an AI-powered customer platform with all the software, integrations, and resources you need to connect your marketing, sales, and customer service. HubSpot's connected platform enables you to grow your business faster by focusing on what matters most: your customers.
Get started 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