This book covers combinatorial data structures and algorithms, algebraic issues in geometric computing, approximation of curves and surfaces, and computational topology. Each chapter fully details and provides a tutorial introduction to important concepts and results. The focus is on methods which are both well founded mathematically and efficient in practice. Coverage includes references to open source software and discussion of potential applications of the presented techniques.

This book covers combinatorial data structures and algorithms, algebraic issues in geometric computing, approximation of curves and surfaces, and computational topology. Each chapter fully details and provides a tutorial introduction to important concepts and results. The focus is on methods which are both well founded mathematically and efficient in practice. Coverage includes references to open source software and discussion of potential applications of the presented techniques.

Never HIGHLIGHT a Book Again Virtually all testable terms, concepts, persons, places, and events are included. Cram101 Textbook Outlines gives all of the outlines, highlights, notes for your textbook with optional online practice tests. Only Cram101 Outlines are Textbook Specific. Cram101 is NOT the Textbook. Accompanys: 9780521673761

Never HIGHLIGHT a Book Again! Virtually all of the testable terms, concepts, persons, places, and events from the textbook are included. Cram101 Just the FACTS101 studyguides give all of the outlines, highlights, notes, and quizzes for your textbook with optional online comprehensive practice tests. Only Cram101 is Textbook Specific. Accompanys: 9783540332589 .

This is an introductory textbook for undergraduates studying mathematics, engineering, or computer science, and explains how differential and computational geometry are used to explain the mathematics of curves and surfaces. It assumes only a basic knowledge of vector and matrix algebra, andis filled with numerous exercises, solutions, and worked examples. Ideal for those interested in computer graphics or computer-aided design, this book will be invaluable for those needing to understand the complex mathematics which lies behind these important areas of application.

"Curves and Surfaces in Geometric Modeling: Theory and Algorithms offers a theoretically unifying understanding of polynomial curves and surfaces as well as an effective approach to implementation that you can apply to your own work as a graduate student, scientist, or practitioner." "The focus here is on blossoming - the process of converting a polynomial to its polar form - as a natural, purely geometric explanation of the behavior of curves and surfaces. This insight is important for more than just its theoretical elegance - the author demonstrates the value of blossoming as a practical algorithmic tool for generating and manipulating curves and surfaces that meet many different criteria. You'll learn to use this and other related techniques drawn from affine geometry for computing and adjusting control points, deriving the continuity conditions for splines, creating subdivision surfaces, and more." "It will be an essential acquisition for readers in many different areas, including computer graphics and animation, robotics, virtual reality, geometric modeling and design, medical imaging, computer vision, and motion planning."--BOOK JACKET.Title Summary field provided by Blackwell North America, Inc. All Rights Reserved

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

In the last thirty years Computational Geometry has emerged as a new discipline from the field of design and analysis of algorithms. That dis cipline studies geometric problems from a computational point of view, and it has attracted enormous research interest. But that interest is mostly concerned with Euclidean Geometry (mainly the plane or Eu clidean 3-dimensional space). Of course, there are some important rea sons for this occurrence since the first applieations and the bases of all developments are in the plane or in 3-dimensional space. But, we can find also some exceptions, and so Voronoi diagrams on the sphere, cylin der, the cone, and the torus have been considered previously, and there are manY works on triangulations on the sphere and other surfaces. The exceptions mentioned in the last paragraph have appeared to try to answer some quest ions which arise in the growing list of areas in which the results of Computational Geometry are applicable, since, in practiee, many situations in those areas lead to problems of Com putational Geometry on surfaces (probably the sphere and the cylinder are the most common examples). We can mention here some specific areas in which these situations happen as engineering, computer aided design, manufacturing, geographie information systems, operations re search, roboties, computer graphics, solid modeling, etc.

Shape interrogation is the process of extraction of information from a geometric model. It is a fundamental component of Computer Aided Design and Manufacturing (CAD/CAM) systems. The authors focus on shape interrogation of geometric models bounded by free-form surfaces. Free-form surfaces, also called sculptured surfaces, are widely used in the bodies of ships, automobiles and aircraft, which have both functionality and attractive shape requirements. Many electronic devices as well as consumer products are designed with aesthetic shapes, which involve free-form surfaces. This book provides the mathematical fundamentals as well as algorithms for various shape interrogation methods including nonlinear polynomial solvers, intersection problems, differential geometry of intersection curves, distance functions, curve and surface interrogation, umbilics and lines of curvature, geodesics, and offset curves and surfaces. This book will be of interest both to graduate students and professionals.

Computational Geometry: Curve and Surface Modeling provides information pertinent to the fundamental aspects of computational geometry. This book discusses the geometric properties of parametric polynomial curves by using the theory of affine invariants for algebraic curves. Organized into eight chapters, this book begins with an overview of the objects studies in computational geometry, namely surfaces and curves. This text then explores the developments in the theory and application of spline functions, which began with cubic spline functions. Other chapters consider the mechanical background of the cubic spline functions, which is the wooden spline with small deflection. This book discusses as well that in mathematical lofting the information of a geometric shape is given by a set of data points, while in geometric design other ways of representations are available. The final chapter deals with the concepts in the theory of algebraic curves. This book is a valuable resource for mathematicians.