Convex optimization has wide applications in the field of computer science research. Some fundamental concepts, as well as their graphical illustrations, are given in this book.
Melkman的凸包算法 We describe an algorithm, due to Melkman (and based on work by many others), which computes the convex hull of a simple polygonal chain (or simple polygon) in linear time.
