| Effective Computational Geometry for Curves and Surfaces Contributor(s): Boissonnat, Jean-Daniel (Editor), Teillaud, Monique (Editor) |
|
 |
ISBN: 3642069878 ISBN-13: 9783642069871 Publisher: Springer OUR PRICE: $104.49 Product Type: Paperback - Other Formats Published: October 2010 |
| Additional Information |
| BISAC Categories: - Mathematics | Number Systems - Computers | Computer Vision & Pattern Recognition - Mathematics | Graphic Methods |
| Dewey: 004 |
| Series: Mathematics and Visualization |
| Physical Information: 0.74" H x 6.14" W x 9.21" (1.10 lbs) 344 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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 |