作者:Johnson, Graham, Prentice Hall，数字设计中的经典

格雷厄姆扫描算法 这是 Graham Scan 算法的演示，用 Java 实现并随小程序一起提供。 用法 LinkedList< Point> list = new List (); Point p0 = new Point (x, y); list . add(p0); ... Point pn = new Point (x, y); list . add(pn); GrahamScan GS = new GrahamScan (list); GS . Scan(); 参考 TH Cormen, CE Leiserson, RL Rivest & C. Stein (2001)。 算法导论。 第二版，麻省理工学院出版社 RL 格雷厄姆 (1972)。 一种确定有限平面集凸包的有效算法。 信息处理快报 1, 132-133 或者干脆在这里： :

看到很多版本都是没书签的，所以就自己添了书签造福一下大家 小小劳动成果，还请尊重，若有错误还请多指教w Abstraction： Programming in Haskell Second Edition Haskell is a purely functional language that allows programmers to rapidly develop clear, concise and correct software. The language has grown in popularity in recent years, both in teaching and in industry. This book is based on the author’s experience of teaching Haskell for more than 20 years. All concepts are explained from first principles and no programming experience isrequired, making this book accessible to a broad spectrum of readers. While Part I focuses on basic concepts, Part II introduces the reader to more advanced topics. This new edition has been extensively updated and expanded to include recent and more advanced features of Haskell, new examples and exercises, selected solutions, and freely downloadable lecture slides and code. The presentation is clean and simple, while also being fully compliant with the latest version of the language, including recent changes concerning applicative, monadic, foldable and traversable types. GRAHAM HUTTON is Professor of Computer Science at the University of Nottingham. He has taught Haskell to thousands of students and received numerous best lecturer awards. Hutton has served as an editor of the Journal of Functional Programming, chair of the Haskell Symposium and the International Conference on Functional Programming, vice-chair of the ACM Special Interest Group on Programming Languages, and he is an ACM Distinguished Scientist.

Graham凸包算法.doc

Graham算法求凸包完整程序代码.doc

本文参考自<<算法导论>>章节33.3,利用Graham算法寻找二位平面散点集的凸包,利用OpenGL将计算的结果绘制出来.算法主要利用向量的叉积判断点和线段的位置关系,详见 向量叉积,然后从左下角点按逆时针方向寻找最边缘的线段,利用的原理就是从凸包上任意一点逆时针出发,每到一个节点,一定会向左拐.资源包包含完整的代码实现,部分测试数据和测试结果.

计算机经典，Graham Knuth Patashnik合著离散数学。 C O N C R E T E MATHEMATICS Ronald L. Graham AT&T Bell Laboratories Donald E. Knuth Stanford University Oren Patashnik Stanford University

High-speed Digital Design - Johnson & Graham.

本文参考自<>章节33.3 寻找凸包,用C++实现了,Grahan和Jarvis两种算法求平面散点集的凸包,注释详细,代码精简,并用OpenGL绘制出所求结果予以验证.

graham求凸包算法 graham求凸包算法 graham求凸包算法 graham求凸包算法 graham求凸包算法 graham求凸包算法