Input a sequence of the convex polygons and it must produce all the triangulations of these polygons. Polygons will always have vertices denoted by uppercase letters.
The first line of the entry contains the number of polygons to be processed. Each other line
Contains a sequence of uppercase letters denoting vertices of polygons. Each
Polygon will have at most 24 vertices.
The output must contain a sequence of lines for each polygon, each line containing one
Sequence of the diagonals of a triangulation. Each triangulation must be output at one time. The output triangulations must be numbered.
The sample of the entry:
A B C D
The output sample:
1 PR PS
2 PR TR
3 QS QT
4 QS PS
5 TQ TR
Hi there.. I have read your project details completely and willing to do it for you... Check my recent reviews for our quality work on on time delivery Please inbox and we can discuss about project...