Effective Computational Geometry for Curves and Surfaces

Monique Teillaud

ISBN 10: 3642069878 / ISBN 13: 9783642069871

Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Okt 2010, 2010

About this Item

This item is printed on demand - Print on Demand Titel. Neuware -Computational geometry emerged as a discipline in the seventies and has had considerable success in improving the asymptotic complexity of the solutions tobasicgeometricproblemsincludingconstructionsofdatastructures,convex hulls, triangulations, Voronoi diagrams and geometric arrangements as well as geometric optimisation. However, in the mid-nineties, it was recognized that the computational geometry techniques were far from satisfactory in practice and a vigorous e ort has been undertaken to make computational geometry more practical. This e ort led to major advances in robustness, geometric software engineering and experimental studies, and to the development of a large library of computational geometry algorithms, Cgal. The goal of this book is to take into consideration the multidisciplinary nature of the problem and to provide solid mathematical and algorithmic foundationsfore ectivecomputationalgeometryforcurvesandsurfaces. This book covers two main approaches. In a rst part, we discuss exact geometric algorithms for curves and s- faces. We revisit two prominent data structures of computational geometry, namely arrangements (Chap. 1) and Voronoi diagrams (Chap. 2) in order to understand how these structures, which are well-known for linear objects, behave when de ned on curved objects. The mathematical properties of these structures are presented together with algorithms for their construction. To ensure the e ectiveness of our algorithms, the basic numerical computations that need to be performed are precisely speci ed, and tradeo s are considered between the complexity of the algorithms (i. e. the number of primitive calls), and the complexity of the primitives and their numerical stability. Chap.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 356 pp. Englisch.

Seller Inventory # 9783642069871

Bibliographic Details

• Title: Effective Computational Geometry for Curves and Surfaces
• Publisher: Springer Berlin Heidelberg, Springer Berlin Heidelberg Okt 2010
• Publication Date: 2010
• Language: English
• ISBN 10: 3642069878
• ISBN 13: 9783642069871
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 20D millimeters 235 millimeters width by 155 millimeters height by 20 millimeters depth
• Weight: 540 grams

About this title

Synopsis

This title outlines the foundations of non-linear computational geometry. It 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 can serve as a textbook on non-linear computational geometry. It will also be useful to engineers and researchers working in computational geometry or other fields, like structural biology, 3D medical imaging, CAD/CAM, robotics, and graphics.

Review

From the reviews:

"Boissonat and Teillaud have collected in this book the foundations of a computational geometry that no longer deals exclusively with linear objects but also with curved objects that arise in applications. The book is composed of eight chapters written by teams of experts in each theme, and is the result of an European Union project named ECG. The book can serve as an advanced graduate course on computational geometry and as a reference for researchers interested in geometric algorithms for curved objects." (Luiz Henrique de Figueiredo, MathDL, March, 2007)