The Book Review Column s by William Gasarch and Samir Khulle r Department of Computer Scienc e University of Maryland at College Park College Park, MD, 2074 2 email: gasarch@cs .umd .edu Welcome to the Book Reviews Column . We hope to bring you at least two reviews of books ever y month . In this column three books are reviewed . This particular column has a guest co-edito r Samir Khuller because one of the books reviewed is by the usual editor William Gasarch . Sami r Khuller handled that review (e .g., decided if it was in scope, found a reviewer, and proofread th e final review). William Gasarch will not see the review until he reads it in SIGACT NEWS . 1. Computational geometry in C (Second Edition) , by Joseph O'Rourke . Reviewe d by : Michael Dekhtyar . This book is an introductory text in Computational Geometry . Th e algorithms are explained on a variety of levels including actual code . 2. Bounded Queries in Recursion Theory by William Gasarch and Georgia Martin . Re viewed by Lance Fortnow . This book looks at the complexity of a function in terms of ho w many queries to some oracle are needed to compute it . The context is recursion-theoretic . 3. Logic For Applications (Second Edition) , By Anil Nerode and Richard A . Shore . Reviewed by Alexander Dekhtyar . This book contains both logic and logic programming , and the connections between the two . Review oft Computational geometry in C Second Edition, 199 8 Author : Joseph O'Rourk e Softcover $29 .95, ISBN 052164976 5 Hardcover $69 .95, ISBN 052164010 5 Publisher : Cambridge University Pres s 424 Page s Reviewer : Michael Dekhtyar Department of Computer Scienc e Tver State University Tver, 170000, Russi a Michael .Dekhtyar@tversu .ru 1 Overview The book under review is the second edition of an introductory textbook in computational geometry . This area has seen intense development during the last two decades . Machine graphics, patter n recognition, robot motion are the main sources of the problems in this area . For many of thes e problems "simple" solutions can be found by brute force algorithms . But their efficient, practicall y implementable solutions need the deep insight into geometrical structures as well as the delicat e 1 © William Gasarch and Samir Khuller 1999 . 2 © Michael Dekhytar, 1999 8
/lp/association-for-computing-machinery/book-review-computational-geometry-in-c-second-edition-by-joseph-o-okrdZD6XJY