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

1st Edition

Guillaume Damiand, Pascal Lienhardt

A K Peters/CRC Press
Published September 19, 2014
Reference - 404 Pages
ISBN 9781482206524 - CAT# K21513

For Instructors Request Inspection Copy

was $110.00

USD$88.00

SAVE ~$22.00

Add to Wish List
FREE Standard Shipping!

Summary

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.

Instructors

We provide complimentary e-inspection copies of primary textbooks to instructors considering our books for course adoption.

Request an
e-inspection copy

Share this Title