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.
埃及的牛人写的.. Imagine that you have a piece of wood and a number of metal pins come out from it randomly (as in the above image), and you picked up an elastic rubber band and open it wide with your hand to contain all the metal pins and let it go. You w
An in-place algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the algorithm. In this paper we describe three in-place algorithms for computing the convex hull of a
埃及的牛人写的.. Imagine that you have a piece of wood and a number of metal pins come out from it randomly (as in the above image), and you picked up an elastic rubber band and open it wide with your hand to contain all the metal pins and let it go. You w
