Algorithm to triangulate monotone polygon

Implement an algorithm that triangulates a monotone polygon (monotone along the y-axis) 1. Implement code that checks if the polygon is monotone in linear time. Assume that the polygon is given as a sequence of n coordinate pairs, that all the corrdinates are integers and distinct. Prove that checking routine runs in linear time. 2. Implement code that assumes that the input polygon is monotone, and the triangulates the polygon in linear time. The output should be the list of n-2 triangles.

## Deliverables

1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Complete ownership and distribution copyrights to all work purchased. 3) A [url removed, login to view] file that prove why the algorithm is in linear time.

## Platform

Windows XP under Microsoft Visual c++

C プログラミング エンジニアリング ゲームデザイン MySQL PHP ソフトウェアアーキテクチャ ソフトウェアテスト

プロジェクトID: #2902607

プロジェクトについて