Click here to Skip to main content
15,902,276 members
Articles / Web Development / HTML

A Polygon-triangulation Algorithm with Time Complexity O(N*logN)

Rate me:
Please Sign up or sign in to vote.
4.87/5 (8 votes)
16 Jan 2016CPOL4 min read 31.3K   713   31  
This tip will introduce a library written in C++ that wraps up a 2d polygon triangulation algorithm with time complexity of O(N*logN), the algorithm works on both self-intersected and non self-intersected polygons.

Views

Daily Counts

Downloads

Weekly Counts

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)


Written By
Student
United States United States
Over 10 years working experience on computer programming in c/c++

I'm interested in computer graphics, and the related fields.

I have been benefited from this site, and other Open source community for years, and it is my turn to contribute back.

Data visualization is the pivot for computer graphics application, I am going to develop the basic tools to visualize the 3d data, from static to animation on Windows with OpenGL or DirectX. I will wrap the core part into a library portable to other platforms and make those libraries open and free to use.


Once I am able to manipulate the data, rendering the data, then everything in the 3d world is open to me, and I am stepping in.

Thanks to my employer Beijing Pencho Pai Fashion Technology, for offering the opportunity on 3d graphics application development, the true commitment will come in 2016

Comments and Discussions