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.

About the Author:

Damiand, Guillaume; Lienhardt, Pascal

"About this title" may belong to another edition of this title.

Store Description

We carry a wide selection of books from South Asia, United States, UK.

Visit Seller's Storefront

Seller's business information

Readingos GmbH
Kaiserstra�e 47, Frankfurt am Main, 60329, Germany

Terms of Sale:

Shipping Terms:

To ensure faster delivery, books may be shipped from any of the following locations Germany, the United Kingdom (UK), the United States (US), based on the buyer's address and product availability.

Payment Methods
accepted by seller

Add to Wants

Items related to Combinatorial Maps: Efficient Data Structures for Computer...

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

Damiand, Guillaume; Lienhardt, Pascal

New - Soft cover

Seller's business information