Notice bibliographique
- Notice
Type(s) de contenu et mode(s) de consultation : Texte noté : électronique
Titre(s) : Effective computational geometry for curves and surfaces [Texte électronique] / Jean-Daniel Boissonnat, Monique Teillaud, ed.
Publication : Berlin, Heidelberg : Springer Berlin Heidelberg : Springer e-books, 2006
Description matérielle : 1 online resource
Collection : Mathematics and Visualization
Note(s) : Titre provenant de la page de titre du document numérisé. - Numérisation de l'édition de Berlin : Springer, cop. 2007. - Bibliogr. p. 321-340. Index
Fichiers PDF.
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
Autre(s) auteur(s) : Teillaud, Monique (1961-....)
Boissonnat, Jean-Daniel (1953-....). Fonction indéterminée
Sujet(s) : Géométrie -- Informatique
Géométrie différentielle
Topologie combinatoire
Surfaces (mathématiques)
Indice(s) Dewey :
518 (23e éd.) = Analyse numérique ; 516.002 85 (23e éd.) = Géométrie - Informatique appliquée
Identifiants, prix et caractéristiques : ISBN 9783540332596
Identifiant de la notice : ark:/12148/cb44686477v
Notice n° :
FRBNF44686477
(notice reprise d'un réservoir extérieur)