1 votes 1 votes A triangulation of a polygon is a set of $T$ chords that divide the polygon into disjoint triangles. Every triangulation of $n$ vertex convex polygon has ____ chords and divides the polygon into ____ triangles $n-2, n-1$ $n-3, n-2$ $n-1, n$ $n-2, n-2$ Algorithms ugcnetcse-june2016-paper3 algorithms dynamic-programming + – go_editor asked Aug 20, 2016 edited Jun 10, 2020 by soujanyareddy13 go_editor 2.2k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Answer s B Explanation s here https://www.google.co.in/url?sa=t&source=web&rct=j&url=http://www.utdallas.edu/~daescu/polygon-triangulation.pdf&ved=0ahUKEwirgZOnj_XVAhXBPY8KHeKQDTwQFggnMAI&usg=AFQjCNHrVy86jvGB7bdrphdVwcLFYVzy3Q Gayathri L answered Aug 26, 2017 Gayathri L comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes can someone plesss provide answer for this question... kavikeve answered Jun 6, 2017 kavikeve comment Share Follow See all 0 reply Please log in or register to add a comment.