Algebraic Geometry and Geometric Modeling

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Elkadi, Mohamed (Επιμελητής έκδοσης), Mourrain, Bernard (Επιμελητής έκδοσης), Piene, Ragni (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006.
• Σειρά: Mathematics and Visualization,
• Θέματα: Mathematics.; Computer science > Mathematics.; Algebraic geometry.; Mathematical models.; Applied mathematics.; Engineering mathematics.; Algebraic Geometry.; Mathematical Modeling and Industrial Mathematics.; Math Applications in Computer Science.; Appl.Mathematics/Computational Methods of Engineering.

 Algebraic Geometry provides an impressive theory targeting the understanding of geometric objects defined algebraically. Geometric Modeling uses every day, in order to solve practical and difficult problems, digital shapes based on algebraic models. In this book, we have collected articles bridging these two areas. The confrontation of the different points of view results in a better analysis of what the key challenges are and how they can be met. We focus on the following important classes of problems: implicitization, classification, and intersection. The combination of illustrative pictures, explicit computations and review articles will help the reader to handle these subjects. 

 Algebraic geometry and geometric modeling: insight and computation -- Implicitization using approximation complexes -- Piecewise approximate implicitization: experiments using industrial data -- Computing with parameterized varieties -- Implicitization and Distance Bounds -- Singularities and their deformations: how they change the shape and view of objects -- Overview of topological properties of real algebraic surfaces -- Illustrating the classification of real cubic surfaces -- Bézier patches on almost toric surfaces -- On parametric surfaces of low degree in P3(C) -- On the intersection with revolution and canal surfaces -- A sampling algorithm computing self-intersections of parametric surfaces -- Elimination in generically rigid 3D geometric constraint systems -- Minkowski decomposition of convex lattice polygons -- Reducing the number of variables of a polynomial.