Mon compte
Ma liste - 0
Catalogue
Ressources numériques
Nouveautés
Liens utiles
Mon compte
Recherche rapide
Recherche avancée
Recherche alphabétique
Historique
Information
Recherche
Auteur
Titre
Sujet
Titre de revue
Collection
Editeur
Note
Tous mots
ISBN
PPN
Modifier la recherche
>
CERGY
Elargir la recherche
Sur le même sujet :
Computer Applications in Geosciences
Ingénierie
Algorithm Analysis and Problem Complexity
Math Applications in Computer Science
Systems and Information Theory in Engineering
Computer science
Mathematical geography
Computer graphics.
Geometry.
Computer science
Logiciel
Computer graphics.
Geometry.
Parcourir le catalogue
par auteur:
Berg , Mark
Cheong , Otfried
Kreveld , Marc
Overmars , Mark
Rechercher sur Internet
Localiser dans une autre bibliothèque (SUDOC) (PPN ou ISBN ou ISSN)
Aperçu dans Google Books
Affichage MARC
Auteur :
Berg , Mark
Titre :
Computational Geometry : Algorithms and
Applications
, by Mark Berg, Otfried Cheong, Marc Kreveld, Mark Overmars.
Edition :
Third Edition.
Editeur :
Berlin, Heidelberg , Springer Berlin Heidelberg , Springer e-books -- 2008
ISBN:
978-3-540-77974-2
Notes :
L'accès complet au document est réservé aux usagers des établissements qui en ont fait l'acquisition
Computational geometry emerged from the ?eld of algorithms design and analysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The success of the ?eld as a research discipline can on the one hand be explained from the beauty of the problems studied and the solutions obtained, and, on the other hand, by the many application domains—computer graphics, geographic information systems (GIS), robotics, and others—in which geometric algorithms play a fundamental role. For many geometric problems the early algorithmic solutions were either slow or dif?cult to understand and implement. In recent years a number of new algorithmic techniques have been developed that improved and simpli?ed many of the previous approaches. In this textbook we have tried to make these modern algorithmic solutions accessible to a large audience. The book has been written as a textbook for a course in computational geometry, but it can also be used for self-study
Nécessite un lecteur de fichier PDF
Contient :
Computational Geometry: Introduction ; Line Segment Intersection: Thematic Map Overlay ; Polygon Triangulation: Guarding an Art Gallery ; Linear Programming: Manufacturing with Molds ; Orthogonal Range Searching: Querying a Database ; Point Location: Knowing Where You Are ; Voronoi Diagrams: The Post Office Problem ; Arrangements and Duality: Supersampling in Ray Tracing ; Delaunay Triangulations: Height Interpolation ; More Geometric Data Structures: Windowing ; Convex Hulls: Mixing Things ; Binary Space Partitions: The Painter's Algorithm ; Robot Motion Planning: Getting Where You Want to Be ; Quadtrees: Non-Uniform Mesh Generation ; Visibility Graphs: Finding the Shortest Route ; Simplex Range Searching: Windowing Revisited ; Bibliography ; Index
Sujet :
Computer
Applications
in
Geosciences
Ingénierie
Algorithm Analysis and Problem Complexity
Math
Applications
in
Computer
Science
Systems and Information Theory in Engineering
Computer
science
Mathematical geography
Computer
graphics.
Geometry.
Computer
science
Logiciel
Computer
graphics.
Geometry.
Exemplaires
Pas de données exemplaires
Pour toute question,
contactez la bibliothèque
Horizon Information Portal 3.25_france_v1m© 2001-2019
SirsiDynix
Tous droits réservés.