Effective Computational Geometry for Curves and Surfaces

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...

Full description

Bibliographic Details
Other Authors: Boissonnat, Jean-Daniel (Editor), Teillaud, Monique (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2006, 2006
Edition:1st ed. 2006
Series:Mathematics and Visualization
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 04108nmm a2200421 u 4500
001 EB000375816
003 EBX01000000000000000228868
005 00000000000000.0
007 cr|||||||||||||||||||||
008 130626 ||| eng
020 |a 9783540332596 
100 1 |a Boissonnat, Jean-Daniel  |e [editor] 
245 0 0 |a Effective Computational Geometry for Curves and Surfaces  |h Elektronische Ressource  |c edited by Jean-Daniel Boissonnat, Monique Teillaud 
250 |a 1st ed. 2006 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2006, 2006 
300 |a XII, 344 p  |b online resource 
505 0 |a 1 Arrangements - Efi Fogel, Dan Halperin, Lutz Kettner, Monique Teillaud, Ron Wein, Nicola Wolpert -- 2 Curved Voronoi Diagrams - Jean-Daniel Boissonnat, Camille Wormser, Mariette Yvinec -- 3 Algebraic Issues in Computational Geometry - Bernard Mourrain, Sylvain Pion, Susanne Schmitt, Jean-Pierre Técourt, Elias Tsigaridas, Nicola Wolpert -- 4 Differential Geometry on Discrete Surfaces - David Cohen-Steiner, Jean-Marie Morvan -- 5 Meshing of Surfaces - Jean-Daniel Boissonnat, David Cohen-Steiner, Bernard Mourrain, Günter Rote, Gert Vegter -- 6 Delaunay Triangulation Based Surface Reconstruction - Frédéric Cazals, Joachim Giesen -- 7 Computational Topology: An Introduction - Günter Rote, Gert Vegter -- 8 Appendix - Generic Programming and the Cgal Library - Efi Fogel, Monique Teillaud -- References -- Index 
653 |a Image processing / Digital techniques 
653 |a Engineering mathematics 
653 |a Numerical Analysis 
653 |a Computer vision 
653 |a Computational Mathematics and Numerical Analysis 
653 |a Mathematics / Data processing 
653 |a Information visualization 
653 |a Computer Imaging, Vision, Pattern Recognition and Graphics 
653 |a Geometry 
653 |a Numerical analysis 
653 |a Engineering / Data processing 
653 |a Data and Information Visualization 
653 |a Mathematical and Computational Engineering Applications 
700 1 |a Teillaud, Monique  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Mathematics and Visualization 
028 5 0 |a 10.1007/978-3-540-33259-6 
856 4 0 |u https://doi.org/10.1007/978-3-540-33259-6?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 516 
520 |a 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