| Description |
1 online resource (vii, 109 pages) : illustrations |
| Series |
Lecture notes in computer science ; 606 |
|
Lecture notes in computer science ; 606.
|
| Summary |
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 |
| Bibliography |
Includes bibliographical references (pages 100-104) and index |
| Notes |
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. http://purl.oclc.org/DLF/benchrepro0212 MiAaHDL |
|
Print version record |
|
digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL |
| Subject |
Convex polytopes.
|
|
Matroids.
|
|
Algorithms.
|
|
Algorithms
|
|
algorithms.
|
|
Algorithms
|
|
Convex polytopes
|
|
Matroids
|
|
Computergraphics.
|
| Form |
Electronic book
|
| ISBN |
9783540472599 |
|
3540472592 |
|
