Help | |
Home - Math Discover - Geometry Computer (Books) |
1-20 of 100 | Next 20 |
click price to see details click image to enlarge click link to go to the store
1. Multiple View Geometry in Computer Vision by Richard Hartley, Andrew Zisserman | |
Paperback: 672
Pages
(2004-04-19)
list price: US$100.00 -- used & new: US$74.99 (price subject to change: see help) Asin: 0521540518 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (10)
Good book, but....
SH*** happens....
Good on the explanations of the theory
Missing a chapter
Valuable and full of useful content |
2. Turtle Geometry: The Computer as a Medium for Exploring Mathematics (Artificial Intelligence) by Harold Abelson, Andrea diSessa | |
Paperback: 497
Pages
(1986-07-09)
list price: US$45.00 -- used & new: US$24.98 (price subject to change: see help) Asin: 0262510375 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (5)
Amazing book
Good enough
forward thinking book about using the computer for mathematics education
My favorite geometry textbook I strongly recommend this bookto anyone with interests in computer programming, geometry and physics. The unusual approach this book takes to the understanding of curved spaceis deceptively simple and surprisingly powerful.
Very good book to show how to use logo as a tool for math |
3. Geometric Algebra for Computer Science (Revised Edition): An Object-Oriented Approach to Geometry (The Morgan Kaufmann Series in Computer Graphics) by Leo Dorst, Daniel Fontijne, Stephen Mann | |
Hardcover: 664
Pages
(2007-04-06)
list price: US$69.95 -- used & new: US$46.40 (price subject to change: see help) Asin: 0123749425 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Until recently, all of the interactions between objects in virtual 3D worlds have been based on calculations performed using linear algebra. Linear algebra relies heavily on coordinates, however, which can make many geometric programming tasks very specific and complex-often a lot of effort is required to bring about even modest performance enhancements. Although linear algebra is an efficient way to specify low-level computations, it is not a suitable high-level language for geometric programming.
Customer Reviews (4)
ok, but...
very good text
An excellent introduction to the subject.
A reader from Los Alamos, NM |
4. Computational Geometry: Algorithms and Applications by Mark de Berg, Marc van Kreveld, Mark Overmars | |
Paperback: 386
Pages
(2010-11-30)
list price: US$49.95 -- used & new: US$35.00 (price subject to change: see help) Asin: 3642096816 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (16)
let my money back assp
Concise reference for computational geometry
Good book, not for a primer
The definitive guide to computational geometry.
Excellent Background |
5. Computational Geometry in C (Cambridge Tracts in Theoretical Computer Science) by Joseph O'Rourke | |
Paperback: 390
Pages
(2001-02-15)
list price: US$46.99 -- used & new: US$27.95 (price subject to change: see help) Asin: 0521649765 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (7)
Excellent text, obfuscated code
collates useful computational geometric algorithms
Nice balance of theory with code The mode of presentation -- supporting a discussion of the theories with implementable code -- is actually a bit refreshing.For comparison:Other books, when discussing the line segment intersection problem (ie: Given a set of line segments, find all of their intersection points) simply assume that computing the intersection of a pair of segments can be done in constant time.This is not an especially difficult problem, but the discussion seems more complete with a brief description of how this might be done.The same can be said about other primitive tests and operations in other algorithms. Overall, this book can stand alone as an excellent introduction to computational geometry, but a serious student in the subject will want more: perhaps Preparata and Shamos or de Berg et. al.
Very hepful The ability to visualize objects in an abstract subject like algebraic geometry boils down to, in the case of toric varieties, to a consideration of how to manipulate polytopes geometrically. A major portion of the book, if not all of it, is devoted to the computational geometry of polyhedra. Because it is an introductory book, some more advanced topics, such as Bayesian methods to find similarities between polyhedra, and neural network approaches to classifying polyhedral objects are not treated. Readers who need to do such things will be well-prepared for them after a study of this book. In addition, there are good exercises assigned at the end of each chapter, so the book could be used in the classroom. Some readers will however choose to use it as a reference source, and it would be a good one, for the author gives references to topics that he only touched upon in the book. Some particular areas that were treated especially well were: 1. The discussion on data structures for surfaces of polyhedra. Although not very general, since he choose to deal with only triangulated polytopes, readers who need to be more general will have a good start in this discussion. 2. The discussion on volume overflow and how to deal with it using robust computation. 3. The discussion, albeit short, of the randomized incremental algorithm. 4. The treatment on the minimum spanning tree and Kruskal's algorithm. Communication network performance optimization is now a major application of this algorithm and others in graph theory, including the author's later discussion of Dijkstra's algorithm.
my rewiew |
6. Computational Geometry: An Introduction (Monographs in Computer Science) by Franco P. Preparata, Michael Ian Shamos | |
Hardcover: 420
Pages
(1985-08-23)
list price: US$134.00 -- used & new: US$89.89 (price subject to change: see help) Asin: 0387961313 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description A fundamental task of computational geometry is identifying condepts, properties, and techniques which aid efficient algorithmic implementations from geometric problems. The approach taken here is the presentation of algorithms and the evaluation of their worst-case complexity. The particular classes of problems addressed include geometric searching and retrieval, convex hull construction and related problems, proximity, intersection, and the geometry of rectangles. Computational Geometry: An Introduction presents its methodology through detailed case studies. The book, primarily conceived as an early graduate text, should also be essential to researchers and professionals in the fields of computer-aided design, computer graphics and robotics. Customer Reviews (6)
Christians fundimentalists have the King James Version, Computational geometrists have...
This book is history
Very useful for code development. Very clear and readable.
Useful but thick The book only gets 4 stars because it's hard to read. It took me several tries to pick up the ideas in this text. I think the De Berg text is MUCH easier to read. The book is also getting a little dated. Some of the topics have come a long way since the 80's. This book seems to be in most University libraries if you have that option.
Still interesting after so many years ... |
7. Computational Geometry and Computer Graphics in C++ by Michael J. Laszlo | |
Paperback: 266
Pages
(1995-10-20)
list price: US$106.20 -- used & new: US$56.77 (price subject to change: see help) Asin: 0132908425 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description This book provides an accessible introduction to methods incomputational geometry and computer graphics. It emphasizesthe efficient object-oriented implemenation of geometricmethods with useable C++ code for all methods discussed. Customer Reviews (4)
A good start The first three chapters introduce the reader to the notion of algorithms and data structures. The author uses the boundary-intersection problem to illustrate the main points of the chapter, such as algorithmic paradigms and abstract data types. Complexity measures for algorithms are discussed briefly, along with mathematical induction. The linked list data structures he discusses are very important in computational geometry, especially the pointer-based implementation. In chapter 4, the author discusses the data structures that are needed for dealing with geometric structures in dimension 2 and 3. After a review of vector algebra he defines the point class and then the vertex class. The latter, along with the polygon class, is used to define polygons as a cycle of vertices which are stored in a circular doubly linked list. These are generalized to 3 dimensions where classes are given for points, triangles, and edges. The author then gives an algorithm for finding the intersection of a line and a triangle, which uses projection, and tests for degeneracy before projecting. The next part of the book deals with applications of the algorithms, such as finding a star-shaped polygon in a finite set of points, finding the convex hull of a set of points, the decision problem for points inside polygons, the Cyrus-Beck and Sutherland-Hodgman algorithms for clipping geometric objects to convex polygons, and an O(nlogn) algorithm for triangulating a monotone polygon. The treatment is very understandable and should prepare the reader for more advanced reading(especially in computer graphics). The famous gift wrapping algorithm for finding the convex hull is given, along with the Graham scan algorithm. Issues more pertinent to computer graphics, such as rendering are discussed also. The hidden surface removal problem is solved via depth sorting. An algorithm is also given for finding the Delaunay triangulation. In addition, the author does a nice job of showing how to use plane-sweep algorithms for computational geometry problems in the plane. An interesting O((r + n)logn) time algorithm for finding the number r of pairs of n line segments in the plane that intersect. Voronoi diagrams are discussed also, which are extensively used in applications. The latter few chapters are more specialized than the rest of the book, and concentrate on divide and conquer algorithms and binary search trees.
Author's response Are my references deficient because the papers it cites are no less than four years old (relative to the book's release date), and some even date to the 1970s? Most of the methods I present were devised years and even decades ago. I chose these methods to suit the book's purpose and audience; I chose methods that are basic, yet which a less sophisticated reader will find interesting and accessible. Similarly, I chose the book's references so they would be relevant to the book's content and useful to the reader. The choice of what topics to present is always to some degree at the author's discretion, particularly in a book such as this which explores ideas without attempting comprehensive coverage. Critics can always be found who will take issue at the omission of this topic or the inclusion of that, or with how some topic is presented. But again, I chose the material with my book's objectives and audience in mind. Relative to the expectations of a computational geometer or a graduate student, my book cannot compare to Preparata and Shamos', or to Mark deBerg's. Their audience doesn't require a book that spends half its time covering such fundamentals as algorithm analysis, lists and stacks, search trees, and elementary sorting and searching methods. Their audience would expect only the most limited coverage of these things, or no coverage at all. In contrast, given my book's target audience, to omit these topics would be to leave out the very background that the rest of the book not only requires, but that the intended reader likely lacks. Omitting such material would be a disservice to the intended reader. Likewise, to include certain more difficult topics which are the meat of these more advanced books would go well beyond the scope of my book, and to do this would also be a disservice to the intended reader. My book differs significantly from these other books in its objectives and its intended audience.
Embarassingly bad Several fundamental concepts in computational geometry are screwedup or omitted entirely.For example, there is NO discussion of point-lineduality, or of the duality between Delaunay triangulations and Voronoidiagrams, or of the simple connection between 2d Delaunay trianglations and3d convex hulls.The simple primitive "Are these three points inclockwise order?" is explained using trig (compare angles) instead oflinear algebra (compare slopes).[These may seem like technical trivia tonovices, but that's why you buy books like this -- in the hopes that atleast the technical trivia is done right!] The book describes slowalgorithms for problems such as Voronoi diagrams, when equally simplefaster algortihms have been known for many years.Despite its 1996publication date and the rapid development of the field, the book doesn'treference a single paper newer than 1990, and very few newer than1980! Inexcusably for a book with hunderds of lines of source code, thecode isn't available online, on either the publisher's or the author's website.For all we know, it doesn't even compile, much less work! If youwant to learn about computational geometry, this is NOT the book to buy. For programmers, Joe O'Rourke's "Computational Geometry in C" ismuch more readable, accurate, and up to date.For aspiring computationalgeometers, Mark de Berg et al's "Comptuational Geometry: Algorithmsand Applications" is indispensible.Even the old standard by Preprataand Shamos, depite being 15 years out of date, is better than this one. Laszlo's book is just embarassing.
clear book but you'll have to type the code. |
8. Applied Geometry for Computer Graphics and CAD (Springer Undergraduate Mathematics Series) by Duncan Marsh | |
Paperback: 352
Pages
(2004-11-05)
list price: US$39.95 -- used & new: US$23.56 (price subject to change: see help) Asin: 1852338016 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Focussing on the manipulation and representation of geometrical objects, this book explores the application of geometry to computer graphics and computer-aided design (CAD). New features in this revised and updated edition include: the application of quaternions to computer graphics animation and orientation; discussions of the main geometric CAD surface operations and constructions: extruded, rotated and swept surfaces; offset surfaces; thickening and shelling; and skin and loft surfaces; an introduction to rendering methods in computer graphics and CAD: colour, illumination models, shading algorithms, silhouettes and shadows. Over 300 exercises are included, many of which encourage the reader to implement the techniques and algorithms discussed through the use of a computer package with graphing and computer algebra capabilities. A dedicated website also offers further resources and links to other useful websites. Customer Reviews (1)
Good computer graphics text |
9. Euclidean and Transformational Geometry: A Deductive Inquiry by Shlomo Libeskind | |
Hardcover: 371
Pages
(2007-11-01)
list price: US$129.95 -- used & new: US$48.39 (price subject to change: see help) Asin: 0763743666 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (4)
Euclidean and Transformational Geometry
Memorable Geometry
Fantastic Resource
Review from Karen |
10. Using Algebraic Geometry (Graduate Texts in Mathematics) by David A. Cox, John Little, Donal O'Shea | |
Paperback: 558
Pages
(2005-03-17)
list price: US$54.95 -- used & new: US$38.81 (price subject to change: see help) Asin: 0387207333 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (2)
Good introduction In general this is a good book and worth reading, if one needs an introduction to the areas covered. Students could definitely benefit from its perusal.
Don't bother |
11. A Survey of Classical and Modern Geometries: With Computer Activities by Arthur Baragar | |
Paperback: 370
Pages
(2000-12-30)
list price: US$73.33 -- used & new: US$65.31 (price subject to change: see help) Asin: 0130143189 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (1)
Worst math text I ever had |
12. Linear Geometry with Computer Graphics (Pure and Applied Mathematics) by John Loustau, Meighan Dillon | |
Hardcover: 458
Pages
(1992-12-16)
list price: US$90.95 -- used & new: US$84.02 (price subject to change: see help) Asin: 0824788982 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description |
13. Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series) by Herbert Edelsbrunner | |
Hardcover: 423
Pages
(2004-02-27)
list price: US$179.00 -- used & new: US$51.44 (price subject to change: see help) Asin: 354013722X Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description |
14. Digital Geometry: Geometric Methods for Digital Picture Analysis (The Morgan Kaufmann Series in Computer Graphics) by Reinhard Klette, Azriel Rosenfeld | |
Hardcover: 672
Pages
(2004-08-20)
list price: US$86.95 -- used & new: US$44.94 (price subject to change: see help) Asin: 1558608613 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (2)
An Excellent Book
A great book on Digital Geometry |
15. Fractal Geometry and Computer Graphics (Beiträge zur Graphischen Datenverarbeitung) | |
Paperback: 257
Pages
(1992-11-19)
list price: US$59.00 -- used & new: US$59.00 (price subject to change: see help) Asin: 3540553177 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description |
16. Lines and Curves: A Practical Geometry Handbook by Victor Gutenmacher, N.B. Vasilyev | |
Paperback: 158
Pages
(2004-07-23)
list price: US$59.95 -- used & new: US$29.62 (price subject to change: see help) Asin: 0817641610 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description The text focuses on the geometrical properties of paths traced by moving points, the sets of points satisfying given geometric constraints, and questions of maxima and minima; it is, therefore, well positioned for companion use with software packages like Geometry Sketchpad, and can serve as a guidebook for engineers.Its deeper, interdisciplinary treatment of geometry also makes it ideal for those interested in the subject purely for its beauty, and the development of "Lines and Curves" from first principles makes it accessible to high school students, teachers, and puzzle enthusiasts alike.A wide audience will profit from its careful treatment of geometry and its synthesis of many branches of mathematics. Based on an English translation of the Russian edition by A. Kundu, Saha Istitute of Nuclear Physics, Calcutta, India. Customer Reviews (2)
Excellent Value to Learn Geometry
Beyond outstanding |
17. Combinatorial and Computational Geometry (Mathematical Sciences Research Institute Publications) | |
Hardcover: 628
Pages
(2005-08-08)
list price: US$100.99 -- used & new: US$25.33 (price subject to change: see help) Asin: 0521848628 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description |
18. Descriptive Geometry Worksheets with Computer Graphics, Series B by Eugene B. Pare | |
Paperback: 84
Pages
(1996-10-03)
list price: US$53.20 -- used & new: US$35.00 (price subject to change: see help) Asin: 0023913444 Canada | United Kingdom | Germany | France | Japan | |
19. Discrete Differential Geometry (Oberwolfach Seminars) | |
Paperback: 341
Pages
(2008-03-04)
list price: US$49.95 -- used & new: US$34.99 (price subject to change: see help) Asin: 3764386207 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Discrete differential geometry is an active mathematical terrain where differential geometry and discrete geometry meet and interact. It provides discrete equivalents of the geometric notions and methods of differential geometry, such as notions of curvature and integrability for polyhedral surfaces. Current progress in this field is to a large extent stimulated by its relevance for computer graphics and mathematical physics. This collection of essays, which documents the main lectures of the 2004 Oberwolfach Seminar on the topic, as well as a number of additional contributions by key participants, gives a lively, multi-facetted introduction to this emerging field. |
20. Uncertain Projective Geometry: Statistical Reasoning for Polyhedral Object Reconstruction (Lecture Notes in Computer Science) by Stephan Heuel | |
Paperback: 205
Pages
(2004-06-14)
list price: US$69.95 -- used & new: US$51.20 (price subject to change: see help) Asin: 3540220291 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Algebraic projective geometry, with its multilinear relations and its embedding into Grassmann-Cayley algebra, has become the basic representation of multiple view geometry, resulting in deep insights into the algebraic structure of geometric relations, as well as in efficient and versatile algorithms for computer vision and image analysis. This book provides a coherent integration of algebraic projective geometry and spatial reasoning under uncertainty with applications in computer vision. Beyond systematically introducing the theoretical foundations from geometry and statistics and clear rules for performing geometric reasoning under uncertainty, the author provides a collection of detailed algorithms. The book addresses researchers and advanced students interested in algebraic projective geometry for image analysis, in statistical representation of objects and transformations, or in generic tools for testing and estimating within the context of geometric multiple-view analysis. |
1-20 of 100 | Next 20 |