<電子ブック>
Axioms and Hulls / by Donald E. Knuth
(Lecture Notes in Computer Science. ISSN:16113349 ; 606)
版 | 1st ed. 1992. |
---|---|
出版者 | (Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer) |
出版年 | 1992 |
本文言語 | 英語 |
大きさ | X, 114 p : online resource |
著者標目 | *Knuth, Donald E author SpringerLink (Online service) |
件 名 | LCSH:Computer science LCSH:Application software LCSH:Discrete mathematics LCSH:Computer graphics LCSH:Algorithms FREE:Theory of Computation FREE:Computer and Information Systems Applications FREE:Discrete Mathematics FREE:Computer Graphics FREE:Algorithms |
一般注記 | 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 amap that pinpointed the locations of about 100 cities. They asked, "Which ofthese 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 HTTP:URL=https://doi.org/10.1007/3-540-55611-7 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
Springer eBooks | 9783540472599 |
|
電子リソース |
|
EB00225321 |
書誌詳細を非表示
データ種別 | 電子ブック |
---|---|
分 類 | LCC:QA75.5-76.95 DC23:004.0151 |
書誌ID | 4001090095 |
ISBN | 9783540472599 |