Introduction to Geometric Computing

ISBN-13: 9781848001145 / Angielski / Miękka / 2008 / 360 str.

Sherif Ghali

Opis

Although geometry has been a flourishing discipline for millennia, most of it has seen either no practical applications or only esoteric ones. Computing is quickly making much of geometry intriguing not only for philosophers and mathematicians, but also for scientists and engineers. What is the core set of topics that a practitioner needs to study before embarking on the design and implementation of a geometric system in a specialized discipline? This book attempts to find the answer. Every programmer tackling a geometric computing problem encounters design decisions that need to be solved. What may not be clear to individual programmers is that these design decisions have already been contemplated by others who have gone down some system design path only to discover (usually much later) that the design decisions that were made were lacking in some respect. This book reviews the geometric theory then applies it in an attempt to find that elusive "right" design.

Recenzje

From the reviews:

"This textbook is excellent for students and programmers working in geometric computing. ... The main theme of the book is the definition of coordinate-free geometric software layers for Euclidean, spherical, projective, and oriented projective geometries. ... The reader can learn the way of designing libraries for Euclidean, spherical, projective, and oriented projective geometries. ... The author also presents the classical raster graphics algorithms that are traditionally introduced in an undergraduate computer graphics course." (Attila Fazekas, Zentralblatt MATH, Vol. 1154, 2009)

Spis treści

Preface.- Part 1 Euclidean Geometry.- 2D Computational Euclidean Geometry.- Points and Segments.- A Separate Type for Vectors.- Vector Normalization and Directions.- Affine Combinations.- Lines.- Vector Orthogonality and Linear Dependance.-Geomteric Predicates.- Predicate Return Type.- The Turn Predicate.- Side of Circle Predicate.- Order Predicate.- The Geometry of the Euclidean Line E1.- Immutability of Geometric Objects.- Exercises.- 3D Computational Euclidean Geometry.- Points in Euclidean Space.- Vectors and Directions.- Vector Orthogonality and Linear Dependance.- Planes in Space.- Lines in Space.- Sidedness Predicates in 3D.- Dominant Axis.- Exercises.- Affine Transformations.- Affine Transformations in 2D.- Properties of Affine Transformations.- Composition of Affine Transformations.- Affine Transformations Objects.- Viewport Mapping.- Orthogonal Matrices.- Orthogonal Transformations.- Euler Angles and Rotation in Space.- Rank of a Matrix.- Finding the Affine Mapping Given the Points.- Exercises.- Genericity in Geometric Computing.- Numerical Precision.- Part II Non-Euclidean Geometries.- 1D Computational Spherical Geometry.- 2D Computational Spherical Geometry.- Rotations and Quaternions.- Projective Geometry.- Homogenous Coordinates for Projective Geometry.- Barycentric Coordinates.- Oriented Projective Geometry.- Oriented Projective Intersections.- Coordinate-Free Geometry.- Homogeneous Coordinates for Euclidean Geometry.- Coordinate-Free Geometric Computing.- Introduction to CGAL.- Part IV Raster Graphics.- Segment Scan Conversion.- Polygon-Point Containment.- Illumination and Shading.- Raster-Based Visibility.- Ray Tracing.- Graphs.-Tree and Graph Drawing.- Tree Drawing.- Graph Drawing.- Part VI Geometric and Solid Modeling.- Boundary Representations.- The Halfedge Data Structure and Euler Operators.- BSP Trees in Euclidean and Spherical Geometries .- Geometry-Free Geometric Computing.- Constructive Solid Geometry.- Part VII Vector Visibility.- Visibility from Euclidean to Spherical Spaces.- Visibility in Space.- The PostScript Language.- OpenGL.- The GLOW Toolkit.- Bibliography.-Index

Blurb

The geometric ideas in computer science, mathematics, engineering, and physics have considerable overlap and students in each of these disciplines will eventually encounter geometric computing problems. The topic is traditionally taught in mathematics departments via geometry courses, and in computer science through computer graphics modules. This text isolates the fundamental topics affecting these disciplines and lies at the intersection of classical geometry and modern computing.

The main theme of the book is the definition of coordinate-free geometric software layers for Euclidean, spherical, projective, and oriented-projective geometries. Results are derived from elementary linear algebra and many classical computer graphics problems (including the graphics pipeline) are recast in this new language. Also included is a novel treatment of classical geometric and solid modeling problems. The definition of geometric software layers promotes reuse, speeds up debugging, and prepares the ground for a thorough discussion of advanced topics.

Start-up programs are provided for many programming exercises making this an invaluable book for computer science lecturers as well as software developers and researchers in the computer graphics industry.