简介 · · · · · · One way to advance the science of computational geometry is to make a comprehensive study of fundamental operations that are used in many different algorithms. This monograph attempts such an investigation in the case of two basic predicates: the counterclockwise relation pqr, which states that the circle through points (p, q, r) is traversed counterclockwise when we encounter ... (展开全部) One way to advance the science of computational geometry is to make a comprehensive study of fundamental operations that are used in many different algorithms. This monograph attempts such an investigation in the case of two basic predicates: the counterclockwise relation pqr, which states that the circle through points (p, q, r) is traversed counterclockwise when we encounter the points in cyclic order p, q, r, p,...; and the incircle relation pqrs, which states that s lies inside that circle if pqr is true, or outside that circle if pqr is false. The author, Donald Knuth, is one of the greatest computer scientists of our time. A few years ago, he and some of his students were looking at a map that pinpointed the locations of about 100 cities. They asked, "Which of these cities are neighbors of each other?" They knew intuitively that some pairs of cities were neighbors and some were not; they wanted to find a formal mathematical characterization that would match their intuition. This monograph is the result.
- 刀断流2012-09-29算法的有用资料!
- 「已注销」2013-03-11经典无法超越
- hailiu2012-10-12高德纳的书,当然是经典了,不过难度也是很大的,要花很多时间和精力才能看懂.
- goddessavril2012-12-06经典制作,对数学要求较高
- 粉丝: 14
- 资源: 52
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助