Related Minkowski Sums Question Show Maximum Number Edged S P Tree 2n 3 Polygon N Vertices Q37100988

by

This is related to minkowski sums. Question: Show that themaximum number of edged of the S(P) tree is 2n-3 for a polygon withn vertices.

Solution

Leave a Comment

This site uses Akismet to reduce spam. Learn how your comment data is processed.