Faites connaître cet article à vos amis:
Combinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing Guillaume Damiand 1er édition
Commandé depuis un entrepôt distant
Nos clients disent :
Combinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing
Guillaume Damiand
A Versatile Framework for Handling Subdivided Geometric Objects
Combinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing gathers important ideas related to combinatorial maps and explains how the maps are applied in geometric modeling and image processing. It focuses on two subclasses of combinatorial maps: n-Gmaps and n-maps.
Suitable for researchers and graduate students in geometric modeling, computational and discrete geometry, computer graphics, and image processing and analysis, the book presents the data structures, operations, and algorithms that are useful in handling subdivided geometric objects. It shows how to study data structures for the explicit representation of subdivided geometric objects and describes operations for handling the structures. The book also illustrates results of the design of data structures and operations.
404 pages, 223 black & white illustrations, 8 black & white tables
| Médias | Livres Hardcover Book (Livre avec dos et couverture rigide) |
| Validé | 19 septembre 2014 |
| ISBN13 | 9781482206524 |
| Éditeurs | Apple Academic Press Inc. |
| Pages | 406 |
| Dimensions | 241 × 156 × 27 mm · 738 g |
| Langue et grammaire | Anglais |
