Triangulations Problem

Geometry Level 5

A triangulation of a polygon (polyhedron) is a decomposition of the polygon into triangles (tetrahedra) by drawing non-intersecting diagonals between pairs of vertices. Intuitively, any polygon can be triangulated. Try to prove it. Can any polyhedron be triangulated?

Yes No

Brian Lie by Brian Lie , 26, China

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Aaghaz Mahajan
Apr 13, 2019

The simplest example is the Schönhardt polyhedron

4 Helpful 8 Interesting 3 Brilliant 1 Confused

Any examples for the 2d case?

Alexander Gibson - 2 years, 1 month ago

Log in to reply

The question already states that every polygon can be triangulated.......Think about how we can do it (It is really interesting!!). For further reading, you can also check this

Aaghaz Mahajan - 2 years, 1 month ago

Log in to reply

Hi Aaghaz, I believe this was a misreading of the question on my part, thanks for the clarification and that article

Alexander Gibson - 2 years, 1 month ago

Log in to reply

@Alexander Gibson – You are welcome...:)

Aaghaz Mahajan - 2 years, 1 month ago

1 pending report

Vote up reports you agree with

×

Problem Loading...

Note Loading...

Set Loading...