# Design an O(n)-time algorithm to test whether a given n-vertex polygon is convex. You should not assume that P is simple.

Chapter 22, Creativity #5

Design an O(n)-time algorithm to test whether a given n-vertex polygon is convex. You should not assume that P is simple.

## This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!

**Related Book For**

## Algorithm Design And Applications

1st Edition

**Authors:** Michael T. Goodrich, Roberto Tamassia

**ISBN:** 9781118335918