This book spans the distance between algebraic descriptions of geometric objects and the rendering of digital geometric shapes based on algebraic models. These contrasting points of view inspire a thorough analysis of the key challenges and how they are met. The articles focus on important classes of problems: implicitization, classification, and intersection. Combining illustrative graphics, computations and review articles this book helps the reader gain a firm practical grasp of these subjects.

"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

Possibly the most comprehensive overview of computer graphics as seen in the context of geometric modeling, this two-volume work covers implementation and theory in a thorough and systematic fashion. It covers the computer graphics part of the field of geometric modeling and includes all the standard computer graphics topics. The CD-ROM features two companion programs.

This introduction to the recent exciting developments in the applications of model theory to algebraic geometry, illustrated by E. Hrushovski's model-theoretic proof of the geometric Mordell-Lang Conjecture starts from very basic background and works up to the detailed exposition of Hrushovski's proof, explaining the necessary tools and results from stability theory on the way. The first chapter is an informal introduction to model theory itself, making the book accessible (with a little effort) to readers with no previous knowledge of model theory. The authors have collaborated closely to achieve a coherent and self- contained presentation, whereby the completeness of exposition of the chapters varies according to the existence of other good references, but comments and examples are always provided to give the reader some intuitive understanding of the subject.

Geometric Modeling and Algebraic Geometry, though closely related, are traditionally represented by two almost disjoint scientific communities. Both fields deal with objects defined by algebraic equations, but the objects are studied in different ways. In 12 chapters written by leading experts, this book presents recent results which rely on the interaction of both fields. Some of these results have been obtained from a major European project in geometric modeling.

Taking a novel, more appealing approach than current texts, An Integrated Introduction to Computer Graphics and Geometric Modeling focuses on graphics, modeling, and mathematical methods, including ray tracing, polygon shading, radiosity, fractals, freeform curves and surfaces, vector methods, and transformation techniques. The author begins with f

Until recently, almost 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. Geometric Algebra for Computer Science presents a compelling alternative to the limitations of linear algebra. Geometric algebra, or GA, is a compact, time-effective, and performance-enhancing way to represent the geometry of 3D objects in computer programs. In this book you will find an introduction to GA that will give you a strong grasp of its relationship to linear algebra and its significance for your work. You will learn how to use GA to represent objects and perform geometric operations on them. And you will begin mastering proven techniques for making GA an integral part of your applications in a way that simplifies your code without slowing it down. * The first book on Geometric Algebra for programmers in computer graphics and entertainment computing * Written by leaders in the field providing essential information on this new technique for 3D graphics * This full colour book includes a website with GAViewer, a program to experiment with GA

This edited volume addresses the importance of mathematics for industry and society by presenting highlights from contract research at the Department of Applied Mathematics at SINTEF, the largest independent research organization in Scandinavia. Examples range from computer-aided geometric design, via general purpose computing on graphics cards, to reservoir simulation for enhanced oil recovery. Contributions are written in a tutorial style.

This monograph examines in detail certain concepts that are useful for the modeling of curves and surfaces and emphasizes the mathematical theory that underlies these ideas. The two principal themes of the text are the use of piecewise polynomial representation (this theme appears in one form or another in every chapter), and iterative refinement, also called subdivision. Here, simple iterative geometric algorithms produce, in the limit, curves with complex analytic structure. In the first three chapters, the de Casteljau subdivision for Bernstein-Bezier curves is used to introduce matrix subdivision, and the Lane-Riesenfield algorithm for computing cardinal splines is tied into stationary subdivision. This ultimately leads to the construction of prewavelets of compact support. The remainder of the book deals with concepts of "visual smoothness" of curves, along with the intriguing idea of generating smooth multivariate piecewise polynomials as volumes of "slices" of polyhedra. The final chapter contains an evaluation of polynomials by finite recursive algorithms. Each chapter contains introductory material as well as more advanced results.

Algebraic geometry and geometric modeling both deal with curves and surfaces generated by polynomial equations. Algebraic geometry investigates the theoretical properties of polynomial curves and surfaces; geometric modeling uses polynomial, piecewise polynomial, and rational curves and surfaces to build computer models of mechanical components and assemblies for industrial design and manufacture. The NSF sponsored the four-day ''Vilnius Workshop on Algebraic Geometry and Geometric Modeling'', which brought together some of the top experts in the two research communities to examine a wide range of topics of interest to both fields. This volume is an outgrowth of that workshop. Included are surveys, tutorials, and research papers. In addition, the editors have included a translation of Minding's 1841 paper, ''On the determination of the degree of an equations obtained by elimination'', which foreshadows the modern application of mixed volumes in algebraic geometry. The volume is suitable for mathematicians, computer scientists, and engineers interested in applications of algebraic geometry to geometric modeling.