Muutke küpsiste eelistusi

Curves and Surfaces in Geometric Modeling: Theory and Algorithms [Kõva köide]

  • Formaat: Hardback, 491 pages, kõrgus x laius: 243x194 mm, kaal: 1071 g, illustrations
  • Sari: The Morgan Kaufmann Series in Computer Graphics
  • Ilmumisaeg: 07-Oct-1999
  • Kirjastus: Morgan Kaufmann Publishers In
  • ISBN-10: 1558605991
  • ISBN-13: 9781558605992
Teised raamatud teemal:
  • Formaat: Hardback, 491 pages, kõrgus x laius: 243x194 mm, kaal: 1071 g, illustrations
  • Sari: The Morgan Kaufmann Series in Computer Graphics
  • Ilmumisaeg: 07-Oct-1999
  • Kirjastus: Morgan Kaufmann Publishers In
  • ISBN-10: 1558605991
  • ISBN-13: 9781558605992
Teised raamatud teemal:
Curves and Surfaces for Geometric Design offers both a theoretically unifying understanding of polynomial curves and surfaces and an effective approach to implementation that you can bring to bear on your own work whether youre a graduate student, scientist, or practitioner.Inside, the focus 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 far more than its theoretical elegance, for the author proceeds to demonstrate the value of blossoming as a practical algorithmic tool for generating and manipulating curves and surfaces that meet many different criteria. Youll learn to use this and related techniques drawn from affine geometry for computing and adjusting control points, deriving the continuity conditions for splines, creating subdivision surfaces, and more.The product of groundbreaking research by a noteworthy computer scientist and mathematician, this book is destined to emerge as a classic work on this complex subject. 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.* Achieves a depth of coverage not found in any other book in this field.* Offers a mathematically rigorous, unifying approach to the algorithmic generation and manipulation of curves and surfaces. * Covers basic concepts of affine geometry, the ideal framework for dealing with curves and surfaces in terms of control points.* Details (in Mathematica) many complete implementations, explaining how they produce highly continuous curves and surfaces.* Presents the primary techniques for creating and analyzing the convergence of subdivision surfaces (Doo-Sabin, Catmull-Clark, Loop).* Contains appendices on linear algebra, basic topology, and differential calculus.

Muu info

* Achieves a depth of coverage not found in any other book in this field. * Offers a mathematically rigorous, unifying approach to the algorithmic generation and manipulation of curves and surfaces. * Covers basic concepts of affine geometry, the ideal framework for dealing with curves and surfaces in terms of control points. * Details (in Mathematica) many complete implementations, explaining how they produce highly continuous curves and surfaces. * Presents the primary techniques for creating and analyzing the convergence of subdivision surfaces (Doo-Sabin, Catmull-Clark, Loop). * Contains appendices on linear algebra, basic topology, and differential calculus.
Preface xi
Introduction
1(4)
Geometric Methods in Engineering
1(1)
Examples of Problems Using Geometric Modeling
2(3)
PART I BASICS OF AFFINE GEOMETRY 5(48)
Basics of Affine Geometry
7(46)
Affine Spaces
7(8)
Examples of Affine Spaces
15(1)
Chasles's Identity
16(1)
Affine Combinations, Barycenters
17(3)
Affine Subspaces
20(6)
Affine Independence and Affine Frames
26(5)
Affine Maps
31(7)
Affine Groups
38(2)
Affine Hyperplanes
40(13)
Problems
42(11)
PART II POLYNOMIAL CURVES AND SPLINE CURVES 53(184)
Introduction to the Algorithmic Geometry of Polynomial Curves
55(52)
Why Parameterized Polynomial Curves?
55(11)
Polynomial Curves of Degree 1 and 2
66(3)
First Encounter with Polar Forms (Blossoming)
69(4)
First Encounter with the de Casteljau Algorithm
73(5)
Polynomial Curves of Degree 3
78(6)
Classification of the Polynomial Cubics
84(4)
Second Encounter with Polar Forms (Blossoming)
88(3)
Second Encounter with the de Casteljau Algorithm
91(4)
Examples of Cubics Defined by Control Points
95(12)
Problems
103(4)
Multiaffine Maps and Polar Forms
107(24)
Multiaffine Maps
107(7)
Affine Polynomials and Polar Forms
114(5)
Polynomial Curves and Control Points
119(3)
Uniqueness of the Polar Form of an Affine Polynomial Map
122(1)
Polarizing Polynomials in One or Several Variables
123(8)
Problems
128(3)
Polynomial Curves as Bezier Curves
131(40)
The de Casteljau Algorithm
131(13)
Subdivision Algorithms for Polynomial Curves
144(9)
The Progressive Version of the de Casteljau Algorithm (the de Boor Algorithm)
153(5)
Derivatives of Polynomial Curves
158(2)
Joining Affine Polynomial Functions
160(11)
Problems
166(5)
B-Spline Curves
171(66)
Introduction: Knot Sequences, de Boor Control Points
171(10)
Infinite Knot Sequences, Open B-Spline Curves
181(11)
Finite Knot Sequences, Finite B-Spline Curves
192(9)
Cyclic Knot Sequences, Closed (Cyclic) B-Spline Curves
201(8)
The de Boor Algorithm
209(3)
The de Boor Algorithm and Knot Insertion
212(4)
Polar Forms of B-Splines
216(6)
Cubic Spline Interpolation
222(15)
Problems
230(7)
PART III POLYNOMIAL SURFACES AND SPLINE SURFACES 237(162)
Polynomial Surfaces
239(36)
Polarizing Polynomial Surfaces
239(10)
Bipolynomial Surfaces in Polar Form
249(5)
The de Casteljau Algorithm for Rectangular Surface Patches
254(4)
Total Degree Surfaces in Polar Form
258(4)
The de Casteljau Algorithm for Triangular Surface Patches
262(2)
Directional Derivatives of Polynomial Surfaces
264(11)
Problems
269(6)
Subdivision Algorithms for Polynomial Surfaces
275(36)
Subdivision Algorithms for Triangular Patches
275(25)
Subdivision Algorithms for Rectangular Patches
300(11)
Problems
306(5)
Polynomial Spline Surfaces and Subdivision Surfaces
311(34)
Joining Polynomial Surfaces
311(5)
Spline Surfaces with Triangular Patches
316(7)
Spline Surfaces with Rectangular Patches
323(3)
Subdivision Surfaces
326(19)
Problems
342(3)
Embedding an Affine Space in a Vector Space
345(28)
The ``Hat Construction,'' or Homogenizing
345(8)
Affine Frames of E and Bases of E
353(3)
Extending Affine Maps to Linear Maps
356(3)
From Multiaffine Maps to Multilinear Maps
359(3)
Differentiating Affine Polynomial Functions Using Their Homogenized Polar Forms, Osculating Flats
362(11)
Problems
371(2)
Tensor Products and Symmetric Tensor Products
373(26)
Tensor Products
373(7)
Symmetric Tensor Products
380(3)
Affine Symmetric Tensor Products
383(3)
Properties of Symmetric Tensor Products
386(3)
Polar Forms Revisited
389(10)
Problems
396(3)
PART IV APPENDICES 399(68)
App. A Linear Algebra
401(24)
A.1 Vector Spaces
401(7)
A.2 Linear Maps
408(4)
A.3 Quotient Spaces
412(1)
A.4 Direct Sums
413(8)
A.5 Hyperplanes and Linear Forms
421(4)
App. B Complements of Affine Geometry
425(20)
B.1 Affine and Multiaffine Maps
425(7)
B.2 Homogenizing Multiaffine Maps
432(2)
B.3 Intersection and Direct Sums of Affine Spaces
434(4)
B.4 Osculating Flats Revisited
438(7)
App. C Topology
445(8)
C.1 Metric Spaces and Normed Vector Spaces
445(5)
C.2 Continuous Functions, Limits
450(1)
C.3 Normed Affine Spaces
450(3)
App. D Differential Calculus
453(14)
D.1 Directional Derivatives, Total Derivatives
453(8)
D.2 Jacobian Matrices
461(6)
Bibliography 467(6)
Index 473(18)
About the Author 491
Jean Gallier received the degree of Civil Engineer from the Ecole Nationale des Ponts et Chaussees in 1972 and a Ph.D. in Computer Science from UCLA in 1978. That same year he joined the University of Pennsylvania, where he is presently a professor in CIS with a secondary appointment in Mathematics. In 1983, he received the Linback Award for distinguished teaching. Galliers research interests range from constructive logics and automated theorem proving to geometry and its applications to computer graphics, animation, computer vision, and motion planning. The author of Logic in Computer Science, he enjoys hiking (especially the Alps) and swimming. He also enjoys classical music (Mozart), jazz (Duke Ellington, Oscar Peterson), and wines from Burgundy, especially Volnay.