Combinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing

Author:   Guillaume Damiand ,  Pascal Lienhardt
Publisher:   Apple Academic Press Inc.
ISBN:  

9781482206524


Pages:   406
Publication Date:   19 September 2014
Format:   Hardback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $273.00 Quantity:  
Add to Cart

Share |

Combinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing


Add your own review!

Overview

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.

Full Product Details

Author:   Guillaume Damiand ,  Pascal Lienhardt
Publisher:   Apple Academic Press Inc.
Imprint:   Apple Academic Press Inc.
Dimensions:   Width: 15.60cm , Height: 2.50cm , Length: 23.40cm
Weight:   0.725kg
ISBN:  

9781482206524


ISBN 10:   1482206528
Pages:   406
Publication Date:   19 September 2014
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

Reviews

Guillaume Damiand and Pascal Lienhardt have produced an excellent book that discusses in full details a family of data structures for representing explicitly the connectivity of low-dimensional meshes, such as those used for some image and terrain processing or for modeling and animating geometric shapes. ... it provides a mathematically rigorous introduction to this area of research and gives the attentive reader a deep understanding of n-Gmaps and n-Maps, both as theoretical models and as practical data structures and associated operators. -Jarek Rossignac, Georgia Institute of Technology


An excellent technical teaching tool, especially recommended for college library mathematics and computer science shelves. -Midwest Book Review, January 2015 Guillaume Damiand and Pascal Lienhardt have produced an excellent book that discusses in full details a family of data structures for representing explicitly the connectivity of low-dimensional meshes, such as those used for some image and terrain processing or for modeling and animating geometric shapes. ... it provides a mathematically rigorous introduction to this area of research and gives the attentive reader a deep understanding of n-Gmaps and n-Maps, both as theoretical models and as practical data structures and associated operators. -Jarek Rossignac, Georgia Institute of Technology


Author Information

Damiand, Guillaume; Lienhardt, Pascal

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List