Overview

"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 E. 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 neighbours of each other?"" They knew intuitively that some pairs of cities were neighbours and some were not; they wanted to find a formal mathematical characterization that would match their intuition. This monograph is the result."

Full Product Details

Author:   Donald E. Knuth
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   1992 ed.
Volume:   606
Dimensions:   Width: 21.60cm , Height: 0.60cm , Length: 27.90cm
Weight:   0.454kg
ISBN:  

9783540556114

ISBN 10:   3540556117
Pages:   114
Publication Date:   10 June 1992
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print  
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions