Computational Geometry


Book Description

This introduction to computational geometry focuses on algorithms. Motivation is provided from the application areas as all techniques are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems. Modern insights in computational geometry are used to provide solutions that are both efficient and easy to understand and implement.




Computational Geometry


Book Description

From the reviews: "This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry. ... ... The book is well organized and lucidly written; a timely contribution by two founders of the field. It clearly demonstrates that computational geometry in the plane is now a fairly well-understood branch of computer science and mathematics. It also points the way to the solution of the more challenging problems in dimensions higher than two." #Mathematical Reviews#1 "... This remarkable book is a comprehensive and systematic study on research results obtained especially in the last ten years. The very clear presentation concentrates on basic ideas, fundamental combinatorial structures, and crucial algorithmic techniques. The plenty of results is clever organized following these guidelines and within the framework of some detailed case studies. A large number of figures and examples also aid the understanding of the material. Therefore, it can be highly recommended as an early graduate text but it should prove also to be essential to researchers and professionals in applied fields of computer-aided design, computer graphics, and robotics." #Biometrical Journal#2




Handbook of Discrete and Computational Geometry


Book Description

Jacob E. Goodman, co-founder and editor of Discrete & Computational Geometry, the preeminent journal on this area in the international mathematics and computer science community, joins forces with the distinguished computer scientist Joseph O'Rourke and other well-known authorities to produce the definitive handbook on these two interrelated fields. Over the past decade or so, researchers and professionals in discrete geometry and the newer field of computational geometry have developed a highly productive collaborative relationship, where each area benefits from the methods and insights of the other. At the same time that discrete and computational geometry are becoming more closely identified, applications of the results of this work are being used in an increasing number of widely differing areas, from computer graphics and linear programming to manufacturing and robotics. The authors have answered the need for a comprehensive handbook for workers in these and related fields, and for other users of the body of results. While much information can be found on discrete and computational geometry, it is scattered among many sources, and individual books and articles are often narrowly focused. Handbook of Discrete and Computational Geometry brings together, for the first time, all of the major results in both these fields into one volume. Thousands of results - theorems, algorithms, and tables - throughout the volume definitively cover the field, while numerous applications from many different fields demonstrate practical usage. The material is presented clearly enough to assist the novice, but in enough depth to appeal to the specialist. Every technical term is clearly defined in an easy-to-use glossary. Over 200 figures illustrate the concepts presented and provide supporting examples. Information on current geometric software - what it does, how efficiently it does it, and where to find it - is also included.




Geometric Methods and Applications


Book Description

As an introduction to fundamental geometric concepts and tools needed for solving problems of a geometric nature using a computer, this book fills the gap between standard geometry books, which are primarily theoretical, and applied books on computer graphics, computer vision, or robotics that do not cover the underlying geometric concepts in detail. Gallier offers an introduction to affine, projective, computational, and Euclidean geometry, basics of differential geometry and Lie groups, and explores many of the practical applications of geometry. Some of these include computer vision, efficient communication, error correcting codes, cryptography, motion interpolation, and robot kinematics. This comprehensive text covers most of the geometric background needed for conducting research in computer graphics, geometric modeling, computer vision, and robotics and as such will be of interest to a wide audience including computer scientists, mathematicians, and engineers.




Computational Geometry, Topology and Physics of Digital Images with Applications


Book Description

This book discusses the computational geometry, topology and physics of digital images and video frame sequences. This trio of computational approaches encompasses the study of shape complexes, optical vortex nerves and proximities embedded in triangulated video frames and single images, while computational geometry focuses on the geometric structures that infuse triangulated visual scenes. The book first addresses the topology of cellular complexes to provide a basis for an introductory study of the computational topology of visual scenes, exploring the fabric, shapes and structures typically found in visual scenes. The book then examines the inherent geometry and topology of visual scenes, and the fine structure of light and light caustics of visual scenes, which bring into play catastrophe theory and the appearance of light caustic folds and cusps. Following on from this, the book introduces optical vortex nerves in triangulated digital images. In this context, computational physics is synonymous with the study of the fine structure of light choreographed in video frames. This choreography appears as a sequence of snapshots of light reflected and refracted from surface shapes, providing a solid foundation for detecting, analyzing and classifying visual scene shapes.




Discrete and Computational Geometry


Book Description

An essential introduction to discrete and computational geometry Discrete geometry is a relatively new development in pure mathematics, while computational geometry is an emerging area in applications-driven computer science. Their intermingling has yielded exciting advances in recent years, yet what has been lacking until now is an undergraduate textbook that bridges the gap between the two. Discrete and Computational Geometry offers a comprehensive yet accessible introduction to this cutting-edge frontier of mathematics and computer science. This book covers traditional topics such as convex hulls, triangulations, and Voronoi diagrams, as well as more recent subjects like pseudotriangulations, curve reconstruction, and locked chains. It also touches on more advanced material, including Dehn invariants, associahedra, quasigeodesics, Morse theory, and the recent resolution of the Poincaré conjecture. Connections to real-world applications are made throughout, and algorithms are presented independently of any programming language. This richly illustrated textbook also features numerous exercises and unsolved problems. The essential introduction to discrete and computational geometry Covers traditional topics as well as new and advanced material Features numerous full-color illustrations, exercises, and unsolved problems Suitable for sophomores in mathematics, computer science, engineering, or physics Rigorous but accessible An online solutions manual is available (for teachers only)




Handbook of Discrete and Computational Geometry


Book Description

The Handbook of Discrete and Computational Geometry is intended as a reference book fully accessible to nonspecialists as well as specialists, covering all major aspects of both fields. The book offers the most important results and methods in discrete and computational geometry to those who use them in their work, both in the academic world—as researchers in mathematics and computer science—and in the professional world—as practitioners in fields as diverse as operations research, molecular biology, and robotics. Discrete geometry has contributed significantly to the growth of discrete mathematics in recent years. This has been fueled partly by the advent of powerful computers and by the recent explosion of activity in the relatively young field of computational geometry. This synthesis between discrete and computational geometry lies at the heart of this Handbook. A growing list of application fields includes combinatorial optimization, computer-aided design, computer graphics, crystallography, data analysis, error-correcting codes, geographic information systems, motion planning, operations research, pattern recognition, robotics, solid modeling, and tomography.




Polyhedral and Algebraic Methods in Computational Geometry


Book Description

Polyhedral and Algebraic Methods in Computational Geometry provides a thorough introduction into algorithmic geometry and its applications. It presents its primary topics from the viewpoints of discrete, convex and elementary algebraic geometry. The first part of the book studies classical problems and techniques that refer to polyhedral structures. The authors include a study on algorithms for computing convex hulls as well as the construction of Voronoi diagrams and Delone triangulations. The second part of the book develops the primary concepts of (non-linear) computational algebraic geometry. Here, the book looks at Gröbner bases and solving systems of polynomial equations. The theory is illustrated by applications in computer graphics, curve reconstruction and robotics. Throughout the book, interconnections between computational geometry and other disciplines (such as algebraic geometry, optimization and numerical mathematics) are established. Polyhedral and Algebraic Methods in Computational Geometry is directed towards advanced undergraduates in mathematics and computer science, as well as towards engineering students who are interested in the applications of computational geometry.




Handbook of Computational Geometry


Book Description

Computational Geometry is an area that provides solutions to geometric problems which arise in applications including Geographic Information Systems, Robotics and Computer Graphics. This Handbook provides an overview of key concepts and results in Computational Geometry. It may serve as a reference and study guide to the field. Not only the most advanced methods or solutions are described, but also many alternate ways of looking at problems and how to solve them.




Computational Geometry


Book Description

For beginning graduate-level courses in computational geometry. This up-to-date and concise introduction to computational geometry with emphasis on simple randomized methods is designed for quick, easy access to beginners.